On Thursday 27 June 2002 12:10, Ketil Z. Malde wrote: > *lights go on* > > Of course! While I have about 90K values to sort, it's only a range > from 0 to about 5-600, and a less than even distribution at that. (I > must be a lot denser than I thought. Colin, if you ever happen to pass > by, do let me know, I think I owe you a beer.)
Why don't you implement a decent quicksort (like randomized quicksort) that works on an array? -- Eray Ozkural <[EMAIL PROTECTED]> Comp. Sci. Dept., Bilkent University, Ankara www: http://www.cs.bilkent.edu.tr/~erayo GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE16 874D 539C _______________________________________________ Glasgow-haskell-users mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
