mergesort. Reply
Eray Ozkural
erayo@cs.bilkent.edu.tr
Sun, 20 Oct 2002 15:08:30 +0300
You guys know about the expected running time of randomized quicksort, right?
There is also the heapsort algorithm. Both are fine for *any* data that you
can't do with a bucket/bin sort.
Keep hacking,
--
Eray Ozkural (exa) <erayo@cs.bilkent.edu.tr>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo Malfunction: http://mp3.com/ariza
GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE16 874D 539C