Code Pumpkin

Tag Archives: divide and conquer

Merge Sort | Sorting Algorithm

October 15, 2017
Posted by Dipen Adroja

Merge Sort is a Divide and Conquer algorithm. Divide and conquer algorithms divide the original data into smaller sets of data to solve the problem. During the Mergesort process, the elements of the array or collections are divided into two parts. To split an array, Mergesort will take the middle element of the array and split the […]

Total Posts : 124
follow us in feedly

Like Us On Facebook