read Kadane's <http://www.algorithmist.com/index.php/Kadane%27s_Algorithm>Algo.
On 10/13/07, kannan <[EMAIL PROTECTED]> wrote: > > > hellow! > here is the problem statement. > you have to find the subset having the maximum sum in the given array > of +ve and -ve numbers. > try not to follow brute force method. > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
