I think the only solution will be finding all subsets. 2011/2/9 MONSIEUR <[email protected]>
> @jalaj: text missing.....??? I think i've mentioned question > properly.....is there any thing more u require? > > n Feb 9, 9:45 pm, jalaj jaiswal <[email protected]> wrote: > > @monsieur ... text missing dude > > > > > > > > On Wed, Feb 9, 2011 at 10:12 PM, MONSIEUR <[email protected]> > wrote: > > > Given: An array of integers(may be both positive and negative), we > > > have to find out the minimum positive sum of array(not necessarily > > > continuous). > > > > > example:- {1,-5,7,10,-14,16,-17,20,21,22} > > > > > here answer is -5,-17,22 having sum=0; > > > > > -- > > > You received this message because you are subscribed to the Google > Groups > > > "Algorithm Geeks" group. > > > To post to this group, send email to [email protected]. > > > To unsubscribe from this group, send email to > > > [email protected]. > > > For more options, visit this group at > > >http://groups.google.com/group/algogeeks?hl=en. > > > > -- > > With Regards, > > *Jalaj Jaiswal* (+919019947895) > > Software developer, Cisco Systems > > Final Year Undergraduate, > > IIIT ALLAHABAD > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
