Yeah Kadanes algorithm. It can be done in O(n); *Muthuraj R IV th Year , ISE PESIT , Bangalore*
On Fri, Aug 5, 2011 at 6:49 PM, Naren s <[email protected]> wrote: > http://people.csail.mit.edu/bdean/6.046/dp/ > > -- > 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.
