Mergesort, Quicksort and Heapsort growth

These three sorting algorithms grow at approximately the same rate according to this graph.

They are O(nlogn) on average. Selection sort and bubble sort are O(n^2)
Here's a graph of the O(nlogn) algorithms.