My thought exactly. Quicksort for example has an average case of n log n, just like mergesort.
Also, Big-O notation can primarily be used to see how algorithms scale with larger datasets. Not to see which algorithm is faster. (Although in a lot of cases, the better O-notation algorithm is also the faster one.)