>Hi Bruce,
>
>>>Bubble Sort! ...
>
>>No, I just got curious and checked. Bubble is order N^2, but Quick is order NlogN, which is faster on average, in theory...
>
>In Theory... but if you do it on a peice of paper, Bubble sort is the best. I mean, how can it not be with a name like that.

That's why I said, "in theory" :) Practically speaking, things like pre-sorted "order" condition and dataset size make a lot of difference...