as Number of possible sets are nCk i think complexity of the best solution will be O(k*nCk) (as in siddarths solution) siddharth's solution will fail in case k > 64 a simple recursive program is possible i think in same complexity.
On Thu, Jul 28, 2011 at 6:40 PM, Tushar Bindal <tushicom...@gmail.com>wrote: > though the code given by siddharth seems to be a bit tough to understand > due to one long statement, it gives a good idea to run the main loop fron > 2^k -1 to (2^k - 1)*(2^(n-k)) since these rae the only numbers having k > digits set > > -- > 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. > -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- 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.
