Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re^4: Tracking minimum of values in an array over time

by suaveant (Parson)
on Oct 06, 2011 at 20:15 UTC ( #930057=note: print w/replies, xml ) Need Help??


in reply to Re^3: Tracking minimum of values in an array over time
in thread Tracking minimum of values in an array over time

The array scan was in there to allow comparison of "slow" vs "fast" I believe.

                - Ant
                - Some of my best work - (1 2 3)

  • Comment on Re^4: Tracking minimum of values in an array over time

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://930057]
help
Chatterbox?
[stevieb]: do you have input coming in that you're parsing? if so, update the question. Also add an example of *exactly* what your desired output should look like given an example input
[stevieb]: valgrind doesn't catch a deep internal segfault issue :( sigh

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (4)
As of 2017-04-29 03:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (531 votes). Check out past polls.