C Program For Merge Sort | C Programming
C Program For Merge Sort by Generating Random Numbers and Using time.h Function #include <stdio.h> #include <stdlib.h> #include <time.h> void mergesort ( int a [], int i , int j ); void merge ( int a [], int i1 , int j1 , int i2 , int j2 ); int main () { int a [ 30 ], n , i ; time_t t ; printf ( "Enter the max number \n " ); scanf ( " %d " , & n ); srand (( unsigned ) time (& t )); for ( i = 0 ; i < n ; i ++) { a [ i ] = rand () % 100 ; } for ( i = 0 ; i < n ; i ++) { printf ( " %d \t " , a [ i ]); } mergesort ( a , 0 , n - 1 ); printf ( " \n\n Time taken to complete the mergesort %u \n " , clock () / CLOCKS_PER_SEC); printf ( " \n Sorted array is : \n " ); for ( i = 0 ; i < n ; i ++) printf ( " %d \t " , a [ i ]); return 0 ; } void mergesort ( int a [], int i , int j ) {