Explanation of how different variations of Merge Sort work – Top-Down, Bottom-Up, Natural Merge Sort. Several optimisations of the algorithm is explained. It is shown in understandable manner why the complexity of merge sort is O(NlogN). Optimality of merge sort is explored.

Source code in kotlin is available in github repository