If the array / list is close to being sorted already, it looks like the bubble sort is the fastest sort method of the ones listed, probably because (if I recall correctly, I haven't looked at the code for a bubble sort in a long time).

Of course, that's a BIG assumption, although I'm sure there are ways you could rely on that case being true (none that I am aware of though)...

It doesn't seem to do as well if the data is fairly randomized, needs to be reversed or if the data has few items that are the same.

Great introduction, can't wait to see what else you come up with!