I don’t like algorithms but in these days I had to do practice with sorting algorithms.
So, I made the following algorithms with Java: Selection, Insertion, Merge and Quick sort.
Then i tested with an array of 2.000.000 integers.
Following the results:

Selection Sort (O(n^2)) : 36m11.947s
Insertion Sort (O(n^2)) : 26m35.216s
Merge Sort (O(n)) : 0m1.053s
Quick Sort (O(nlogn)) : 0m0.439s

Amazing huh?
Moreover, QuickSort sorted an array with 20.000.000 integers in just 0m2.486s.

Of course this is not the news of the day: this is it!