Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Categories

finding the slice with the minimum sum from an array algorithm

netgertnetgert Posts: 331Member
lets say that i have an array of integers, both negative and positive mixed up. now i need to get the low and high bounds of a slice in that array that has the minimum sum of elements
i can only think of a O^2 complicity algorithm, but as the max elements can be 1,000,000 i cant use my algorithm
[hr][red][italic][b]N[/b][/red][blue]et[/blue][red][b]G[/b][/red][blue]ert[/italic][/blue][hr]
Sign In or Register to comment.