Skip to main content

Merge Sort Implementation in JAVA



Merge Sort  is a technique of sorting data with below steps:-

1) Divide the data recursively until it can not  divide more.

2)  Compare the data and sort it.

3) Merge the data again .




/*
 * Merge Sort is based on the concept below points:-
 * 1) Divide array until it can not be divide.
 * 2) Merge it again in sorted pattern 
 * 
 * 
 */


public class MergeSort {
 
 

 public static int[]  mergeSort(int arr[])
 {
  
  //check for size if it is one then already sorted
  int size=arr.length;
  if(size==1)
  {
   return arr;
  }
  
  //find middle (divide an array into two half)
  int mid=size/2;
  
  //first half
  int[] fhalf=new int[mid];
  //second half
  int[] shalf=new int[size-mid];
  
   // Copy first half of the array
     for (int i = 0; i < mid; i++)
     { fhalf[i] = arr[i];
     }
     // Copy second half of the array
     for (int i = mid; i < size; i++)
     { shalf[i - mid] = arr[i];
     }      
     
     //recursive call fhalf and shalf
     return merge(mergeSort(fhalf), mergeSort(shalf));
  
 }
 
 public static int[] merge(int[] firstHalfSorted,int[] secondHalfSorted)
 {
  // First, create a new array to store the answer. 
  
   int SortedArray[] = new int[firstHalfSorted.length + secondHalfSorted.length];
 

 

    int m = 0;
         int n = 0;
         int count = 0;
         
         System.out.println("first array");
         printArray(firstHalfSorted);
         System.out.println("second array");
         printArray(secondHalfSorted);
         //compare the elements in both arary
         while (m<firstHalfSorted.length && n<secondHalfSorted.length)
         {
             if (firstHalfSorted[m]>secondHalfSorted[n])
             {
                 SortedArray[count]=secondHalfSorted[n];
                 count++;
                 n++;
             }
             else if (firstHalfSorted[m]<secondHalfSorted[n])
             {
                 SortedArray[count]=firstHalfSorted[m];
                 count++;
                 m++;
             }
         }
         
         //append the remaining elements at the end
         if (m!=firstHalfSorted.length)
         {
             while(m<firstHalfSorted.length){
                 SortedArray[count]=firstHalfSorted[m];
                 count++;
                 m++;
             }
         }
         
         //append the remaining elements at the end
         if (n!=secondHalfSorted.length)
         {
             while(n<secondHalfSorted.length){
                 SortedArray[count]=secondHalfSorted[n];
                 count++;
                 n++;
             }
         }
         System.out.println("sorted array");
         printArray(SortedArray);
  // At last return the sorted array 
   return SortedArray;
 }

 
 public static void printArray(int[] arr)
 {
  //System.out.println("printing array");
  for(int i=0;i<arr.length;i++)
  {
   System.out.print(arr[i]+" ");
  }
  System.out.println(" ");
 }
 
 public static void main(String[] args)
 {
  int arr[]={14,33,27,10,25,19,40,45};
  printArray(arr);
  //calling merge function
  arr=mergeSort(arr);
  printArray(arr);
 }

}


Implementation Steps:-


14 33 27 10 25 19 40 45  
first array
14  
second array
33  
sorted array
14 33  
first array
27  
second array
10  
sorted array
10 27  
first array
14 33  
second array
10 27  
sorted array
10 14 27 33  
first array
25  
second array
19  
sorted array
19 25  
first array
40  
second array
45  
sorted array
40 45  
first array
19 25  
second array
40 45  
sorted array
19 25 40 45  
first array
10 14 27 33  
second array
19 25 40 45  
sorted array
10 14 19 25 27 33 40 45  
10 14 19 25 27 33 40 45  

Comments

.

Popular posts from this blog

Selection Sort in JAVA

What is selection sort? It is a sorting technique that is based on the partitioning of array into two parts, sorted and unsorted. The process is:- 1) Find minimum element in unsorted array. 2) Swap the element at the end of sorted array. when i=0 we don't have any sorted array so element will be replaced from first element later the sorted array end will growas the index. Steps:- underline elements are sorted array, the length is increasing with each minimum element added at the end. minimum element11 11 25 12 22 64 minimum element12 11 12 25 22 64 minimum element22 11 12 22 25 64 minimum element25 11 12 22 25 64 minimum element64 11 12 22 25 64 Program:- package sorting ; public class SelectionSort { //function to print array public static void print ( int [] arr ) { for ( int i = 0 ; i <= arr . length - 1 ; i ++) System . out . print ( " " + arr [ i ]); System . out . printl

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:-  Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60  https://leetcode.com/list/5eie1aqd/ Must do medium:-  https://leetcode.com/list/5xaelz7g/ Must do Easy:-   https://leetcode.com/list/5r7rxpr1/ Graph:-  https://leetcode.com/list/x18ervrd/  Dynamic Programming:-    https://leetcode.com/list/x14z0dxr/  FaceBook interviews:- https://leetcode.com/list/xyu98pv6/  Amazon Interviews:-  https://leetcode.com/list/5hkniyf7/  Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md