forked from jainaman224/Algo_Ds_Notes
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Merge_Sort.c
62 lines (46 loc) · 725 Bytes
/
Merge_Sort.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include<stdio.h>
void merge(int lf[], int rt[], int a[], int m, int n)
{
int i,j,k;
i = j = k = 0;
while(i<m && j<n)
{
if(lf[i]<rt[j])
a[k++]=lf[i++];
else
a[k++]=rt[j++];
}
while(i<m)
a[k++]=lf[i++];
while(j<n)
a[k++]=rt[j++];
}
void divide(int a[], int n)
{
int i, lf[n/2], rt[n-n/2];
if(n<=1)
return ;
for(i=0;i<n/2;i++)
lf[i]=a[i];
for(i=n/2;i<n;i++)
rt[i-n/2]=a[i];
divide(lf, n/2);
divide(rt, n-n/2);
merge(lf, rt, a, n/2, n-n/2);
}
int main()
{
int n,i;
//scanf("%d",&n);
n=7;
int a[7]={3, 1, 6, 2, 8, 7, 9};
// for(i=0;i<n;i++)
// scanf("%d",&a[i]);
divide(a,n);
for(i=0;i<n;i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}
// Output :
// 1 2 3 6 7 8 9