Data_Structures/Merge_Sort at master · balachandarsv/Data_Structures · GitHub

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
#include<stdio.h>
#include<conio.h>
void mergesort(int array[],int low,int mid,int high)
{
int i,l,m,k,temp[50];
i=low;l=low;m=mid+1;
while((l<=mid)&&(m<=high))
{
if(array[l]<=array[m])
{
temp[i]=array[l];
l++;
}
else
{
temp[i]=array[m];
m++;
}
i++;
}
if(l>mid)
{
for(k=m;k<=high;k++)
{temp[i]=array[k];i++;}
}
else
{
for(k=l;k<=mid;k++)
{
temp[i]=array[k];i++;
}
}
for(k=low;k<=high;k++)
array[k]=temp[k];
}

void partition(int *array,int low,int high)
{
int mid;
if(low<high)
{
mid=(low+high)/2;
partition(array,low,mid);
partition(array,mid+1,high);
mergesort(array,low,mid,high);
}
}

void main()
{
int array[50],n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&array[i]);
partition(array,0,n-1);
printf("\n");
for(i=0;i<n;i++)
printf("%d\t",array[i]);
getch();
}