On Mon, 19 Sep 2005 22:58:40 GMT, [EMAIL PROTECTED] (Bengt Richter) wrote:
>On 19 Sep 2005 00:02:34 -0700, "malv" <[EMAIL PROTECTED]> wrote:
>
>>Simple case:
>>In this list, how to find all occurences of intervals of n adjacent
>>indexes having at least one list-member with a value between given
>
On 19 Sep 2005 00:02:34 -0700, "malv" <[EMAIL PROTECTED]> wrote:
>Simple case:
>In this list, how to find all occurences of intervals of n adjacent
>indexes having at least one list-member with a value between given
>limits.
>Visualizing the list as a two-dimensional curve, this is like
>horizonta
I am not interested in doing your homework.
--
http://mail.python.org/mailman/listinfo/python-list
How about posting example data and results?
--
http://mail.python.org/mailman/listinfo/python-list
Have you tried coding even the brute-force naive search? It is far
easier to improve an algorithm when you have someplace relatively
concrete to start from. Plus, the naive approach is most likely to
return a correct result, so that you can regression test your exotic
interval-skipping, second-de
On 19 Sep 2005 00:02:34 -0700, malv <[EMAIL PROTECTED]> wrote:
> Simple case:
> In this list, how to find all occurences of intervals of n adjacent
> indexes having at least one list-member with a value between given
> limits.
> Visualizing the list as a two-dimensional curve, this is like
> horizo
Simple case:
In this list, how to find all occurences of intervals of n adjacent
indexes having at least one list-member with a value between given
limits.
Visualizing the list as a two-dimensional curve, this is like
horizontally dragging a given rectangle over the curve and finding the
x coordina
