Quicksort, heapsort, and mergesort are 3 N lg(n) sorts, which makes them 3 of the fastest sorts, asymptotically. All sorts get slower as you add more points, but N lg(n) sorts do not get slower as quickly as N^2 sorts, which is why you see N lg(n) sorts as the commonly used ones.
