http://www.geeksforgeeks.org/largest-sum-contiguous-subarray/
On Fri, Aug 30, 2013 at 11:49 PM, Don <dondod...@gmail.com> wrote: > Use Kadane's algorithm. > http://en.wikipedia.org/wiki/Maximum_subarray_problem > Don > > > On Thursday, August 29, 2013 11:09:59 PM UTC-4, yash wrote: >> >> 1. find largest sum contiguous subarray >> 2. find the contiguous subarray which produce largest sum >> >> Ex: >> a[7] = {2,1,-7,5,8,-1,-3} >> Ans is: a[3] to a[5] and array is :{5,8} maxsum=13 >> or pls find the minsum and is a[2] ={-7} >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroups.com. > -- Ajay A Jampale | Lead Engineer, Samsung R&D Institute, Bangalore,India M:+91.9741494304 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
