can someone plz provide the solution to it??? On Sat, Sep 10, 2011 at 9:30 PM, sukran dhawan <sukrandha...@gmail.com>wrote:
> best way it to invoke the function recursively > > just like a k-1 ary tree > correct me if im wrong > > On Sat, Sep 10, 2011 at 2:49 PM, Ishan Aggarwal < > ishan.aggarwal.1...@gmail.com> wrote: > >> 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 algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.com <puneet.ar...@aricent.com> -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
