Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Brute force (Re: Sorting data that don't fit in memory)

by dws (Chancellor)
on Jan 24, 2001 at 22:41 UTC ( #54072=note: print w/replies, xml ) Need Help??


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

If you're in a hurry to get something working, and will have time to work on a faster method later, consider a brute force approach: only sort what you can fit in memory, and then merge the resulting sorted files.

"It's not the Zen way, but it gets the job done." -- Garrison Keiler

  • Comment on Brute force (Re: Sorting data that don't fit in memory)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (4)
As of 2020-11-01 00:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My favourite web site is:












    Results (291 votes). Check out past polls.

    Notices?