Quicksort is a comparison sort that has an average performance of O(n log n) and is an efficient way to put elements in an array in order.