I think its a NP problem. The solution complexity can go up O(2^N) in worst case.
On Mon, Jun 20, 2011 at 11:55 AM, Navneet Gupta <navneetn...@gmail.com>wrote: > Given a set of integers , find a set of numbers such that they sum to a > given number k . > Notice the set of numbers can have 2 or more than 2 numbers. > > > --Navneet > > -- > 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.
