Robin Sheat wrote:
: Have you considered using a data structure that is always sorted,
: such as a tree or a priority queue (backed by a heap or
: something).
From the Heap::Simple docs:
A heap is a partially sorted structure where it's always easy
to extract the smallest element. If the collection of elements
is changing dynamically, a heap has less overhead than keeping
the collection fully sorted.
HTH,
Charles K. Clarkson
--
Mobile Homes Specialist
254 968-8328
--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
<http://learn.perl.org/> <http://learn.perl.org/first-response>
