>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.
>
>This is a pretty popular thread, there are a handful that hit 50 pretty fast, bu this one has over 50 members participating. Not Bad
That may be because it is the easiest concept to grasp. I mean, if you do it on a piece of paper. In my GW and quick basic days the fastest sort was always the quick and then the tree. The bubble-sort was always the slowest. This is because it takes more iterations to figure out who's first than the other algorithms.