-
Notifications
You must be signed in to change notification settings - Fork 0
/
merge_sort.c
79 lines (64 loc) · 1.22 KB
/
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<stdio.h>
void disp(int *arr, int size){
printf("\n");
for (int i = 0; i < size; i++){
printf("%d ", arr[i]);
}
printf("\n");
}
void merge(int left, int mid, int right, int *arr){
int l_size = mid-left+1;
int r_size = right-mid;
int left_arr[l_size], right_arr[r_size],k = left;
for (int i = 0; i < l_size; i++){
left_arr[i] = arr[k];
k++;
}
for (int i = 0; i < r_size; i++){
right_arr[i] = arr[k];
k++;
}
int i = 0, j = 0;
k = left;
while(i < l_size && j < r_size){
if (left_arr[i] < right_arr[j]){
arr[k] = left_arr[i];
i++;
}
else{
arr[k] = right_arr[j];
j++;
}
k++;
}
while (i < l_size){
arr[k] = left_arr[i];
i++;
k++;
}
while (j < r_size){
arr[k] = right_arr[j];
j++;
k++;
}
}
void mergeSort(int left, int right, int *arr){
if (left < right){
int mid = (left+right)/2;
mergeSort(left, mid, arr);
mergeSort(mid+1, right, arr);
merge(left,mid,right,arr);
}
}
int main(){
int size = 0;
scanf("%d", &size);
int arr[size];
for (int i = 0; i < size; i++){
scanf("%d", &arr[i]);
}
disp(arr, size);
mergeSort(0,size-1,arr);
disp(arr, size);
return 0;
}