Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Re: Re: Fast/Efficient Sort for Large Files

by cecil36 (Pilgrim)
on Dec 19, 2002 at 17:35 UTC ( #221185=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Fast/Efficient Sort for Large Files
in thread Fast/Efficient Sort for Large Files

I wrote a program in C++ to sort web server cache logs by IP address. I discovered that a quicksort took forever to sort the data by the IP address, but a heapsort routine that I had in a programming manual was more efficient. If possible, see if you can utilize a binsort routine. If I recall my algorithms class correctly, binsort runs in O(n) time.
  • Comment on Re: Re: Re: Fast/Efficient Sort for Large Files

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (13)
As of 2016-06-28 14:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (359 votes). Check out past polls.