Merge sort

Merge sort is a divide-and-conquer recursive sorting algorithm.

First, the algorithm divides the array to sort into two sub-arrays until the sub-arrays contain only one element. Then, the each pair of sub-arrays are merged in the correct order. To merge the sub-arrays, the algorithm go through both sub-arrays in the same time.

Resources

https://en.wikipedia.org/wiki/Merge_sort