I'm writing some code for implementing the Quine McCluskey algorithm and I simply need to clear out if my logic for implementation is ok.
I get some number of minterms and combine each of them so they produce an implicant, later I combine these implicants and consider them as prime implicants. So for the new prime implicants plus the unchecked implicants, I treat them as candidates for essential implicants.
So I'm talking about two loops here, for the total minterms right later for total implicants obtained before.
I've tested my code for a few examples and got good results so far but I need to know this works for n minterms.