Quicksort ain't shit

The fact that it's a commonly taught sorting algorithm is just an accident of history and imperative languages' being popular. It's actually quite a lot more complex than merge sort or heap sort and it's much harder to analyze. (Proving that merge sort runs in O(n log n) is relatively easy; proving that quicksort runs in O(n log n) in expectation is quite hard.)

>>18
They aren't, they are data structures where the insertion\deletion algorithm rebalances the tree as it goes. You can use them to sort, but that is just a side-effect.