Merge sort uses:

Explanation

Merge sort is an efficient sorting algorithm that uses a divide-and- conquer approach to order elements in an array. Mergesort has two steps: Merging Sorting. The algorithm uses a divide-and-conquer approach to merge and sort a list. The recursive mergesort algorithm is 1. If the list has only one element, Return the list and terminate. (Base case) 2. Split the list into two halves that are as equal in length as possible. (Divide) 3. Using recursion, sort both lists using mergesort. (Conquer) 4. Merge the two sorted lists and return the result. (Combine)