@piyuesh 3-Sum is not exponential ? its quadratic , check wiki for refrence ?
On Mon, Dec 5, 2011 at 5:36 PM, Piyush Grover <[email protected]>wrote: > As I mentioned earlier solution with exponential time-complexity is the > obvious one. Is there any way to solve this problem by greedy/Dynamic algo? > > > On Mon, Dec 5, 2011 at 5:24 PM, WgpShashank <[email protected]>wrote: > >> @piyuesh , Saurabh isn't 3-Sum Suffics Here ? >> >> Another thought problem can also be thought by generating power set of >> given set e.g. if set has n elemnts its power set has 2^n elements , then >> finds the set that has sum up yo given weight isn't it ? hope you know how >> to find power set efficiently ? >> >> >> >> correct if is missed anything ? >> >> Thanks >> Shashank >> Computer Science >> BIT Mesra >> http://www.facebook.com/wgpshashank >> http://shashank7s.blogspot.com/ >> >> -- >> 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/-/a9F-gPQkjm0J. >> >> 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. > * ** * -- 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.
