Karnaugh Map Implementation

Hi Guys
Pls help me out. I have to implement a karnaugh map simplification algo in C++ for a college assignment and haven't been able to do it so far and deadline is approaching fast. Pls help

Do you need help in making the simplification or converting it to c++?

I need the algo which i should follow.
After that i'd be able to see whether i can convert it to c++ or not.
I found an algo thru google but it wasn't correct

Can i have the exact question ?

if you give the exact requirements we mightbe able to help you

1-how dou you get the function MAXterms or MINterms, or binary?
2-what´s the maximum number of variables?
3-when should you present it?

Well, Freejack, here r the answers to the questions u asked:
1) I get the input in terms of binary for each cell of the map
2) I'm presently trying to do it for 4 variables
3) I've to present it at the earliest the last deadline being 31 March.
So, exactly i've to get the values for each cell of the map and then simplify the map and output the minimum result in sum of product form

I found an algo on the net which I tried to implement.
Here is the URL:
http://hopper.unco.edu/KARNAUGH/Algorithm.html
I implemented most of it except the last step.
Pls help.
Edit: I am uploading the algo.

Do u guys want me to upload the code that I have implemented so far??
Maybe u can suggest something then. Pls help as the deadline is approaching fast...

Here is the code I have so far implemented. Its just a crude implementation with no optimizations and I plan to use linked lists instead of arrays once it is fully working.

well i´m not an expert but i´ll check that code , no promises (i couldnot download the last zip)
maybe you can tell how you´re going
patience