C Programming Tutorial

C Sorting Algorithms - Merge Sorting

#include <stdio.h>

void display(char*msg,int*a);
void merge_sort(int* a);
int main(void)
{

        int a[10]={1,10,20,12,15,13,78,88,99,-1};

        display("before sorting...",a);
        merge_sort(a);
        display("After sorting...",a);

        return 0;
}

void display(char*msg,int*a)
{
        printf("%s  ",msg);
 
       for(int i=0; i < 10; i++)
                printf("%d ",a[i]);

        printf("\n");

}

void merge_sort(int* a){

}                                                                                                                                                      
	

before sorting...  1 10 20 12 15 13 78 88 99 -1 
After sorting...  -1 1 10 12 13 15 20 78 88 99 
	

Time and Space Complexity