Quick sort, which sorts in O(n log n) comparisons, is the most efficient sort algorithm. Quick sort also uses a divide and conquer strategy, just as Merge sort.