Comment Re:Bogus algorithm (Score 3, Insightful) 68
I agree on Bubb..I mean, BS. But Selection Sort is really only useful with big objects that you don't want to move much. These days everything's a Reference, so it doesn't matter so much. It makes for a really boring dance, too.
Insertion Sort is more useful in modern use cases. If something's "almost sorted" it's very quick.
Shell sort might be even better. It's practically identical to Insertion Sort except only subsets of dancers would step out at one time. And, with a good gap sequence, it gets done much quicker than either of the above.