Merge Sort

 Merge Sort





  • We need to break the array into two halves.
  • Once u break the array into two halves, u need to break those two separate halves into 2 more halves, a total of 4. 
  • Like this, we need to break the array, where the individual array will have only one element using recursion.
  • Once the array is broken into tiny pieces, we will join them again by merging them together.
  • To achieve this, first we need to write a program to merge two sorted arrays.

Comments

Popular posts from this blog

Selection Sort

Numbers programs