In our previous lesson in this series we discussed and analyzed Merge sort algorithm Merge sort, as we saw is a recursive algorithm in which we follow a divide-and-conquer strategy the running time of Merge sort is O(nlogn) in worst case but Merge sort is not an in place sorting algorithm and in place sorting […]