On Mon, Apr 07, 2003 at 03:36:10PM -0400, Greg Stark wrote:
> "Ron Peacetree" <rjpeace@earthlink.net> writes:
>
> > AFAIK, there are only 3 general purpose internal sorting techniques
> > that have O(n) behavior:
>
> Strictly speaking there are no sorting algorithms that have worst-case time
> behaviour better than O(nlog(n)). Period.
>
Not true.
http://www.elsewhere.org/jargon/html/entry/bogo-sort.html
-Jay 'Eraserhead' Felice
P.S. <g>
