|
|
|
| Keep It Simple, Stupid | |
| PerlMonks |
Re^5: Heap sorting in perlby Aristotle (Chancellor) |
| on Apr 07, 2003 at 08:49 UTC ( [id://248540]=note: print w/replies, xml ) | Need Help?? |
|
In said note, blakem writes:
Heap sorting is attractive because selecting the smallest M elements from a dataset of size N (N being much larger than M) requires storing only M elements in memory at any one time.That means that he can very well store the entire heap, the M elements, in memory. Makeshifts last the longest.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||