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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
#include<stdlib.h>
#include<stdio.h>
#include<conio.h>
void merge(int a[], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for(i = 0; i < n1; i++)
{
L[i] = a[l + i];
}
for(j = 0; j < n2; j++)
{
R[j] = a[m + 1 + j];
}
i = 0;
j = 0;
k = l;
while(i < n1 && j < n2)
{
if(L[i] <= R[j])
{
a[k] = L[i];
i++;
k++;
}
else
{
a[k] = R[j];
j++;
k++;
}
}
while(i < n1)
{
a[k] = L[i];
i++;
k++;
}
while(j < n2)
{
a[k] = R[j];
j++;
k++;
}
}
void mergesort(int a[], int l, int r)
{
if(l < r)
{
int m = l+(r-1)/2;
mergesort(a, l, m);
mergesort(a, m+1, r);
merge(a, l, m, r);
}
}
void printarray(int A[], int size)
{
int i;
for(i=0; i < size; i++)
{
printf("\n %d", A[i]);
}
}
main()
{
int a[] = {5, 8, 2, 4, 9, 6, 3, 1};
int arr_size = sizeof(a)/sizeof(a[0]);
printf(" the input array is \n");
printarray(a, arr_size);
mergesort(a, 0, arr_size - 1);
printf(" \n the sorted version of the array is \n");
printarray(a, arr_size);
getch();
}
|
