14 Apr
2006
14 Apr
'06
1:32 p.m.
On Fri, 14 Apr 2006, woodelf wrote:
a.carlini at ntlworld.com wrote:
a bit larger than a bubble sort.
But, at least it would tend to be slower.
I'm sure Knuth mentions
"random-sort" as being worse (randomly
shuffle elements, check if order correct, if not then repeat).
Sounds like it
would have the smallest memory ( data and code)
footprint around.