Day: March 4, 2021

Merge Sort

Merge Sort is a divide and conquer algorithm. First we divide the array into two parts (left and right) using the middle index of the array to be sorted. Then we sort each part separately and finally combine the parts together in order.