Merge Sort is an algorithm use divide and conquer approach in which the array is split in two halves, calls itself for the two halves and then merges the two sorted halves on which we try to perform merge sort. So in merge sort we will break array into sub arrays, these subarrays into even smaller subarrays, until we have multiple subarrays with single element … Continue reading Merge Sort Algorithm