sort rant

Seriously... why can't we just do things ONE WAY? All these different types of sorts, for no reason at all except to get a faster running time with programs made for computers that won't even NOTICE the difference between a selection or merge sort. So what if heap sort has a constant O(n log n) time? I don't care! So stop assigning me stupid CS labs telling me to figure out different sorts.
All this from a high school APCS student...

>>1
Only radixsort and quicksort (and heapsort as an alternative to quicksort) are relevant. All the other sorting algorithms are only taught for the sake of having students understand how to analyze algorythms. You're not being taught "sorting algorithms," you're being taught how to analyze worst-cases, understand Big O notation, etc. You'll never fucking use bubble sort anywhere, moron, but knowing this sort of shit is what tells an ENTERPRISE JAVA PROGRAMMER apart from an EXPERT PROGRAMMER.

IHBT, right?