SORTING TECHNIQUES:- MERGE SORT

#include < stdio.h > #include < conio.h > void main() { int a1[20],a2[20],a3[40]; int max1,max2,max3; clrscr(); printf("\nEnter max1: "); scanf("%d",&max1); read_data(a1,max1); printf("\nEnter max2: "); scanf("%d",&max2); read_data(a2,max2); max3=merge_sort(a1,a2,a3,max1,max2); printf("\nFirst array is \n"); print_data(a1,max1); printf("\nSecond array is \n"); print_data(a2,max2); printf("\nThird array is \n"); print_data(a3,max3); } int read_data(int a[],int max) { int i; printf("\nEnter %d sorted values \n",max); for(i=0;i < max;i++) { scanf("%d",&a[i]); } return; } int print_data(int a[],int max) { int i; for(i=0;i < max;i++) { printf("%4d",a[i]); } return; } int merge_sort(a1,a2,a3,max1,max2) int a1[],a2[],a3[]; int max1,max2; { int i,j,k; i=j=k=0; while(i < max1 && j < max2) { if (a1[i] < a2 [j]) { a3[k++]=a1[i++]; } else { a3[k++]=a2[j++]; } } while (i < max1) { a3[k++]=a1[i++]; } while(j < max2) { a3[k++]=a2[j++]; } return(k); }