Merge sort

• Merge sort algorithm is one of two important divide-and-conquer sorting algorithms (the other one is quick sort).Merge
• MergeIt is a recursive algorithm.Merge
  • MergeDivides the list into halves,Merge
  • MergeSort each halve separately, andMerge
  • MergeThen merge the sorted halves into one sorted array.Merge

In this lesson we will learn how to write a source code in C programming language for doing simple Merge sort using array in ascending order.

Question : Write a c program for Merge sort.

Merge Sort  C Example :

/**
Merge Sort Algorithm C Example by Codebind.com
*/
#include <stdio.h>
#include <stdlib.h>

void PrintArray(int *array, int n) {
  for (int i = 0; i < n; ++i)
    printf("%d ", array[i]);
  printf("\n");
}

void Merger(int arr[], int lo, int  mi, int hi){
    int *temp = new int[hi-lo+1];//temporary merger array
    int i = lo, j = mi + 1;//i is for left-hand,j is for right-hand
    int k = 0;//k is for the temporary array
    while(i <= mi && j <=hi){
        if(arr[i] <= arr[j])
            temp[k++] = arr[i++];
        else
            temp[k++] = arr[j++];
    }
    //rest elements of left-half
    while(i <= mi)
        temp[k++] = arr[i++];
    //rest elements of right-half
    while(j <= hi)
        temp[k++] = arr[j++];
    //copy the mergered temporary array to the original array
    for(k = 0, i = lo; i <= hi; ++i, ++k)
        arr[i] = temp[k];

    delete []temp;
}
void MergeSortHelper(int arr[], int lo, int hi){
    int mid;
    if(lo < hi){
        mid = (lo + hi) >> 1;
        MergeSortHelper(arr, lo, mid);
        MergeSortHelper(arr, mid+1, hi);
        Merger(arr, lo, mid, hi);
    }
}
void MergeSort(int arr[], int arr_size){
    MergeSortHelper(arr, 0, arr_size-1);
}

int main() {
  int array[] = {94, 42, 50, 95, 333, 65, 54, 456, 1, 1234};
  int n = sizeof(array)/sizeof(array[0]);

  printf("Before Merge Sort :\n");
  PrintArray(array, n);

  MergeSort(array, n);

  printf("After Merge Sort :\n");
  PrintArray(array, n);
  return (0);
}


/*
OUTPUT
Before Merge Sort :
94 42 50 95 333 65 54 456 1 2325
After Merge Sort :
1 42 50 54 65 94 95 333 456 2325
*/

Analysis of Merge 

Merging two sorted arrays of size kMerge

• Best-case: Merge
  • MergeAll the elements in the first array are smaller (or larger) than all the elements in the second array.Merge
  • MergeThe number of moves: 2k + 2k Merge
  • MergeThe number of key comparisons: kMerge
• Worst-case: Merge
  • MergeThe number of moves: 2k + 2k Merge
  • MergeThe number of key comparisons: 2k-1Merge