-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMerge_Sort.cpp
More file actions
58 lines (46 loc) · 1.14 KB
/
Merge_Sort.cpp
File metadata and controls
58 lines (46 loc) · 1.14 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
#include <stdio.h>
#define MAX 10
void merge(int *A, int low, int mid, int high) {
int i = low, j = mid + 1, k = low;
int c[MAX]; // Geçici dizi
// Küçükten büyüðe sýralama
while (i <= mid && j <= high) {
if (A[i] <= A[j]) {
c[k++] = A[i++];
} else {
c[k++] = A[j++];
}
}
// Kalan elemanlarý ekle
while (i <= mid) {
c[k++] = A[i++];
}
while (j <= high) {
c[k++] = A[j++];
}
// Sýralanmýþ geçici diziyi geri kopyala
for (i = low; i <= high; i++) {
A[i] = c[i];
}
}
void mergeSort(int *A, int low, int high) {
if (low < high) {
int mid = (low + high) / 2;
mergeSort(A, low, mid);
mergeSort(A, mid + 1, high);
merge(A, low, mid, high);
}
}
int main() {
int arr[MAX] = {8, 1, 4, 9, 2, 0, 3, 6, 7, 5};
printf("Array before sorting:\n");
for (int i = 0; i < MAX; i++)
printf("%d ", arr[i]);
printf("\n");
mergeSort(arr, 0, MAX - 1);
printf("Array after sorting:\n");
for (int i = 0; i < MAX; i++)
printf("%d ", arr[i]);
printf("\n");
return 0;
}