Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #define MAX 999999999
- void merge(int A[],int p,int q,int r)
- {
- int n1 = q-p+1;
- int n2 = r-q;
- int i,j;
- int L[n1],R[n2];
- for(i=1 ; i<=n1; i++)
- {
- L[i] = A[p+i-1];
- }
- for(j=1; j<=n2; j++)
- {
- R[j] = A[q+j];
- }
- L[n1+1]=MAX;
- R[n2+1]=MAX;
- i=1,j=1;
- int k;
- for(k=p;k<=r;k++)
- {
- if(L[i]<=R[j])
- {
- A[k]= L[i];
- i++;
- }
- else
- {
- A[k] = R[j];
- j++;
- }
- }
- }
- void mergesort(int A[],int p,int r)
- {
- int i;
- if(p<r)
- {
- int q = (p+r)/2;
- mergesort(A,p,q);
- mergesort(A,q+1,r);
- merge(A,p,q,r);
- }
- return ;
- }
- int main()
- {
- int A[100],n,i;
- printf("Enter the number of elements: ");
- scanf("%d",&n);
- for(i=1;i<=n;i++)
- {
- scanf("%d",&A[i]);
- }
- mergesort(A,1,n);
- for(i=1;i<=n;i++)
- {
- printf("%d\t",A[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement