Re: Minimum sub-sequence sum

From: matt.timmermans@xxxxxxxxx
Date: Fri, 25 Jul 2008 13:56:19 -0700 (PDT)

On Jul 21, 11:13 pm, Michael Jarrod <Michael.Jar...@xxxxxxxxx> wrote:

Hello,

I have a sequence of integers (positive/negative values) and I would
like to find the sub sequence of consecutive values that yields the
smallest sum, I can think of a very simple O(n^3) complex solution,
however I was wondering are there any better solutions? and what is
the name of this kind of problem?

-Mich

Do you means a subsequence of values at consecutive indexes, or a
subsequence of values that are consecutive integers?
.

References:
- Minimum sub-sequence sum
  - From: Michael Jarrod

Prev by Date: just u click earn money and join life
Next by Date: obvious ("dumb") question about oracles and P vs. NP
Previous by thread: Re: Minimum sub-sequence sum
Next by thread: expressed working machine
Index(es):
- Date
- Thread

Relevant Pages

Re: Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ...
(comp.programming)
Re: Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ...
(sci.math)
Re: Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ... Try different positions for the start of the subsequence ... Calculating the sum of a subsequence ...
(comp.theory)
Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ...
(comp.programming)
Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ...
(comp.theory)