. . . a bubble sort seemed to be correct for this.
I have nothing constructive to offer, I just wanted to thank you for the best laugh I've had today.
Update: It's been brought to my attention that my remark may need some explanation. Basically, nobody with any formal computer science training would ever just use a bubble sort for generic sorting. BS is O(n^2) (CS talk that it performs on the order of the square of the number of elements to be sorted) with a terrible average performance. Perl's builtin sort uses quicksort which is O(n log n) for instance. There are cases where a bubble sort can work (e.g. you know your initial ordering is almost sorted), but for the most part you want to steer clear of it.
For more information, see a text such as Volume Three of Knuth's Art of Computer Programming or Mastering Algorithms with Perl (ISBN 1565923987).
In reply to Re: Funky sorting
by Fletch
in thread Funky sorting
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |