What is the objective of merge sort?

Mergesort in Objective-C ?

The mergesort algorithm is a sorting algorithm developed by John von Neumann back in 1945. The general idea is to take a list of data and recursively divide it into smaller lists until it is very easy to sort the elements in each list. Then, take each list and merge them back one master list.

How can merge sort improve performance?

Use insertion sort for small subarrays. We can improve most recursive algorithms by handling small cases differently. Switching to insertion sort for small subarrays will improve the running time of a typical mergesort implementation by 10 to 15 percent. Test whether array is already in order.