Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling

Re: Sorting data that don't fit in memory

by clemburg (Curate)
on Jan 24, 2001 at 14:31 UTC ( #53932=note: print w/replies, xml ) Need Help??

in reply to Sorting data that don't fit in memory

Mastering Algorithms with Perl discusses your problem on page 150 (External Sorting) and recommends mergesort as the "easiest solution". Mergesort in Perl is described on page 134 and 135. If I recall correctly, there is also a discussion of your problem in Jon Bentley's Programming Pearls. A third source of guidance that is still less extensive than Knuth is Introduction to Algorithms by Cormen, Leiserson, and Rivest (my favourite, contains excellent pseudocode and very good discussions).

Christian Lemburg
Brainbench MVP for Perl

  • Comment on Re: Sorting data that don't fit in memory

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (3)
As of 2020-11-01 00:50 GMT
Find Nodes?
    Voting Booth?
    My favourite web site is:

    Results (291 votes). Check out past polls.