Merge sort is an efficient sorting algorithm that uses the divide and conquer method. In sorting n objects, merge sort has an average and worst-case performance of O(n log n). Pseudocode: Sort the left half of the array. Sort the right half of the array. Merge the two halves.