Mergesort is a popular sorting algorithm that uses a divide-and-conquer approach to sort an array.

• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together