[algogeeks] find the contiguous subarray which produce largest sum

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

Re: [algogeeks] Re: Algorithm page

http://translate.google.com.br/translate?sl=pt&tl=en&js=n&prev=_t&hl=pt-BR&ie=UTF-8&u=http%3A%2F%2Fmarathoncode.blogspot.com.br%2F2013%2F08%2Fjosephus-problem.html http://translate.google.com.br/translate?hl=pt-BR&sl=pt&tl=en&u=http%3A%2F%2Fmarathoncode.blogspot.com.br%2F2013%2F08%2Flinks-da-sema