Average case – Summary

• Quicksort has an expected running time of O(n log n).

• Because of smaller constants, it is often faster than Heapsort or Mergesort in practice.

• If you don't do real-time programming, Quicksort might be the best choice.