Re: Sorting packed arays

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

Comment on Re: Sorting packed arays

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.	[reply]

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.

[reply]