Just to add to my question, I would like the cartesian product program to scale upto 81 sets, and the cardinality of each set can be maximum 9.
I calculated that the resulting cartesian product will have 1.9662705047555291361807590852691e+77 elements. I think it is difficult to store this cartesian product without having large amount of memory installed. I have only 512 MB on my PC which is running Win XP on P4. A friend of mine told me that iterator design pattern could be useful in this scenario. Probably someone could give me ideas on this line. Regards, Mukul --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
