http://www.perlmonks.org?node_id=930072


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

A min heap would be an excellent way to determine the min value of the set at any time. Good call. For my particular problem, since I'm actually interested in making certain that all elements have crossed the floor value (as pointed out by Ant above), I think counting the number of values that cross the floor as they are incremented is the smartest solution.

Good thoughts Ambrus, thanks!

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