The Best Sorting Algorithm

^In this _thread we will discuss sorting algorithms and vote for our favorite one.

I will update the stats every postIndex % 25 posts.  

May the best #sort win!

- Bubble Sort
- Insertion Sort
- Selection Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Shell Sort
- Bucket Sort
- Radix Sort

Vote for one of these or any sort you like. I'll add new sorts to the list when I update stats.

They mean different things. O(1) means that there is some constant upper bound on the running time. O(0) means that that bound is zero.

f(x) = O(g(x)) ⇔ ∃ M. ∀x > x₀. |f(x)| ≤ M|g(x)|
f(x) = O(0) ⇔ |f(x)| ≤ 0| ∀x > x₀
f(x) = O(1) ⇔ ∃M. ∀x > x₀. |f(x)| ≤ M|