Merge sort

The merge sort algorithm is a fast but memory consuming sorting technique. The time complexity is o (n). The concept is to divide the arrays first recurrence until it is divided to one. Then merge the divided arrays in descending or ascending order. The time is n, but more extra memory needed for merging every time.