look for overlapping subproblems.Most of such problems have a recursive solution possible with time complexity o(2^n) and using dp we can reduce the subproblems and get solution of order polynomial.Thats one way of recognizing dp problems. On Fri, Jun 10, 2011 at 11:14 AM, kartik sachan <kartik.sac...@gmail.com>wrote:
> how people think of DP?? can u tell me > > -- > 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. > -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- 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.
