-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort_merge.cpp
More file actions
63 lines (59 loc) · 1.02 KB
/
sort_merge.cpp
File metadata and controls
63 lines (59 loc) · 1.02 KB
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
#include "stdio.h"
int A[10];
void merge(int,int,int);
void merge_sort(int low,int high)
{
int mid;
if(low<high) {
mid=(low+high)/2;
merge_sort(low,mid);
merge_sort(mid+1,high);
merge(low,mid,high);
}
}
void merge(int low,int mid,int high)
{
int h,i,j,b[10],k;
h=low;
i=low;
j=mid+1;
while((h<=mid)&&(j<=high)) {
if(A[h]<=A[j]) {
b[i]=A[h]; h++;
} else {
b[i]=A[j]; j++;
}
i++;
}
if(h>mid) {
for(k=j;k<=high;k++) {
b[i]=A[k]; i++;
}
} else {
for(k=h;k<=mid;k++) {
b[i]=A[k]; i++;
}
}
for(k=low;k<=high;k++)
A[k]=b[k];
}
int main()
{
int num = 10,i, M;
printf("MERGE SORT\n");
//input
printf("Input 10 bilangan:\n");
for (M=0; M<10; M++) {
scanf("%i", &A[M]);
}
printf("Sebelum pengurutan");
for (M=0; M<10; M++) {
printf("%4i", A[M]);
}
merge_sort(0,num-1);
printf("\n\nSetelah pengurutan");
for (M=0; M<10; M++) {
printf("%4i", A[M]);
}
return 0;
}