Bogosort (was: old threaded languages, was Re: Symbolics)

From: John Wilson <wilson_at_dbit.dbit.com>
Date: Wed Mar 1 15:32:41 2000

On Wed, Mar 01, 2000 at 11:21:35AM -0800, Dwight Elvey wrote:
> Actually, the algorithm I used is a kn+c unlike
> QuickSort's k(n*logn) ( c is a constant time overhead ).

OK, I'll bite -- Radix Sort?

John Wilson
D Bit
Received on Wed Mar 01 2000 - 15:32:41 GMT