What would be the efficient way to code this program.?? Given an array of size n, find all the possible sub set of the array of size k(all the subsets must be of size k).
-- Kind Regards Ishan Aggarwal Phone : +91-9654602663 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
