can u elaborate ur answer pls On Mon, Aug 29, 2011 at 12:47 PM, Brijesh <[email protected]>wrote:
> Sort the array and use dynamic programming.. it will take at most n^2 > complexity.! > BY dynamic programming , i mean make a 3D type array.. which will give all > the combination which sums to all the nos.. try it! > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/qyurZAc9r4wJ. > 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. > -- 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.
