in reply to Re: Re: Heap sorting in perl
in thread Heap sorting in perl
The original question didn't specify how the data would be
available, so I'm just going to assume it fits in memory.
Note that a heapsort only requires a constant amount of
memory additional to the data to be sorted.
If the data doesn't fit in memory, then that's a different problem. One can always tie the used array to whatever solution will keep the data to be worked on out of memory.
Abigail
In Section
Seekers of Perl Wisdom