-
Notifications
You must be signed in to change notification settings - Fork 0
/
mergeSort.c
62 lines (55 loc) · 1.34 KB
/
mergeSort.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>
int arr[50], n , search;
void display(int ar[], char* type) {
printf("%s: {", type);
for (int i = 0; i < n; i++)
printf("\t%d", ar[i]);
printf("\t}\n");
}
void initArr(){
int temp;
printf("Enter The Number Of Elements: ");
scanf("%d", &n);
for (int i = 0; i < n; i++) {
printf("Enter The Element %d: ", i + 1);
scanf("%d", &arr[i]);
}
display(arr, "Original Array");
}
void merge(int arr[100], int low, int mid, int high) {
int i, j, k, a[100];
i = low, k = low, j = mid + 1;
while (i <= mid && j <= high) {
if (arr[i] < arr[j]) {
a[k] = arr[i];
i++;
} else if (arr[i] > arr[j]) {
a[k] = arr[j];
j++;
}
k++;
}
while (i <= mid) {
a[k] = arr[i];
i++, k++;
}
while (j <= high) {
a[k] = arr[j];
j++, k++;
}
for (int i = low; i <= high; i++)
arr[i] = a[i];
}
void mergeSort(int arr[100], int low, int high) {
if (low < high) {
int mid = (low + high) / 2;
mergeSort(arr, low, mid);
mergeSort(arr, mid + 1, high);
merge(arr, low, mid, high);
}
}
void main(){
initArr();
mergeSort(arr, 0, n - 1);
display(arr, "Merge Sort");
}