anyone here? On Fri, Jan 21, 2011 at 2:35 PM, snehal jain <learner....@gmail.com> wrote:
> In this variation of the Maximum-Sum Subarray Problem, you are given a > one-dimensional array A[1 : n] of positive or negative numbers, and > you are asked to find a subarray A[i : j] such that the sum of its > elements is (1) strictly greater than zero, and (2) minimum. In other > words, you want to find a subarray of smallest positive sum. Give an > O(nlog^2n) Divide and Conquer algorithm and a O(nlogn) Dynamic > Programming Algorithm. > > -- > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > 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 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.
