## Merge Sort Algorithm in Python

Merge sort algorithm breaks a larger list into several smaller lists, sorts them individually and incrementally merges them back to return the sorted list. For instance, let us say we need to sort a list of 500 elements. An algorithm implementation like bubble sort would take O(n^2) number of steps, which is about 250,000 steps. […]