Basics Sorting Algorithm: MergeSort (Python)

MergeSort splits an array into halves which takes log(n) time and then takes n operations to sort the entire list when we are merging it back after breaking the halves down. Therefore, it has a complexity of O(n log(n)) How it works: Take array, arr ...