You're given an array containing both positive and negative integers and required to find the sub- array with the largest sum (O(N) a la KBL). Write a routine in C for the above
Is this problem as simple as just adding the positive numbers with the subarray with largest sum being the set of positive numbers in the array . Or is there any complications , please explain Thankyou -- 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.
