Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: Heap sorting in perl

by pg (Canon)
on Apr 06, 2003 at 03:43 UTC ( #248390=note: print w/replies, xml ) Need Help??

in reply to Heap sorting in perl

Read that, and its default implementation Heap::Fibonacci. To be frank, don't have a good impression.

The biggest problem I have with it is the storage it used. It used a tree based on hash, instead of a tree based on N-sequential array. A hash uses more memory than n-sequential array, and slower in indexing as "N-sequential" is not utilized.

A N-sequential array is physically just a conventional array, but its element are specially positioned within the array, and can be easily viewed/used as a tree (in this case a heap).

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://248390]
[marto]: I really should have stayed in bed today
[choroba]: exceptions to this rule are rare

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (6)
As of 2018-03-20 10:44 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (250 votes). Check out past polls.