🚀 go-pugleaf

In article <87lnozuhh7.fsf@loki.wkstn.nix>,
Nix  <{$eri}$@esperi.demon.co.uk> wrote:
> Richard Clayton <richard@turnpike.com> writes:
> 
> > it obviously failed to come across when I wrote before... if sorting is
> > taking any time you can actually measure then you're using the wrong
> > algorithm or implementing it poorly. You never use a BubbleSort for
> > anything (he says, provocatively)
> 
> Although modified bubblesorts (variants on shellsorts &c) are quite
> useful, especially when memory is a limited resource so you can't
> afford to use partitioning/recursive schemes like quicksort[1].
> 
> [1] this is assuming you can't be bothered to implement an iterative
>     variant of the quicksort, too.

If you always process the shortest partition first, then the stack
requirements for quicksort are proportional to the log of the number
of items. You need to be seriously short on memory for that to be a
problem.