Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: Sorting packed arays

by spmlingam (Scribe)
on Dec 06, 2008 at 07:18 UTC ( [id://728515]=note: print w/replies, xml ) Need Help??


in reply to Sorting packed arays

You can use Sort::Packed module
. Use mergesort_packed - merge sort is useful for sorting large data

Replies are listed 'Best First'.
Re^2: Sorting packed arays
by salva (Canon) on Dec 06, 2008 at 10:46 UTC
    merge sort is useful for sorting large data

    Well, the merge sort algorithm can be used to sort huge data sets that don't fit in the available RAM, but that doesn't mean that any merge sort implementation does it.

    Actually, as implemented in Sort::Packed (BTW, I am its author), the radixsort uses less memory as it is an inplace operation. The only practical difference between both variants is that merge sort can take advantage of semi sorted data.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://728515]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others imbibing at the Monastery: (3)
As of 2024-04-24 04:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found