-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path103-merge_sort.c
132 lines (115 loc) · 2.14 KB
/
103-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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include "sort.h"
#include <stdlib.h>
#include <stdio.h>
/**
* print_left_right - print left and right partitions
* @array: array
* @size: size of second array
* @first: initial position
* @mid: middle position
*/
void print_left_right(int *array, int size, int first, int mid)
{
int k;
printf("Merging...\n");
printf("[left]: ");
k = first;
while (k < mid)
{
if (k != mid - 1)
printf("%d, ", array[k]);
else
printf("%d\n", array[k]);
k++;
}
printf("[right]: ");
k = mid;
while (k < size)
{
if (k < size - 1)
printf("%d, ", array[k]);
else
printf("%d\n", array[k]);
k++;
}
}
/**
* merge - merge the values in the position of array
* @array: first array
* @size: size of second array
* @cpy: copy of array
* @first: initial position
* @mid: middle position
* first one of the second array
*/
void merge(int *array, int size, int first, int mid, int *cpy)
{
int i, j, k;
print_left_right(array, size, first, mid);
i = first;
j = mid;
printf("[Done]: ");
k = first;
while (k < size)
{
if (i < mid && (j >= size || array[i] <= array[j]))
{
cpy[k] = array[i];
i++;
}
else
{
cpy[k] = array[j];
j++;
}
if (k < size - 1)
printf("%d, ", cpy[k]);
else
printf("%d\n", cpy[k]);
k++;
}
}
/**
* mergeSort - array separator
* @cpy: copy of array
* @first: initial position
* @size: size of the original array
* @array: the original array
*/
void mergeSort(int *cpy, int first, int size, int *array)
{
int mid;
if (size - first < 2)
return;
mid = (size + first) / 2;
mergeSort(array, first, mid, cpy);
mergeSort(array, mid, size, cpy);
merge(cpy, size, first, mid, array);
}
/**
* copy_array - copy array of int
* @arr: array src
* @cpy: array dest
* @size : array size
*/
void copy_array(int *arr, int *cpy, int size)
{
int i;
for (i = 0; i < (int)size; i++)
cpy[i] = arr[i];
}
/**
* merge_sort - create partition and copy
* @array: array
* @size : array size
*/
void merge_sort(int *array, size_t size)
{
int *cpy;
cpy = malloc(sizeof(int) * size - 1);
if (cpy == NULL)
return;
copy_array(array, cpy, size);
mergeSort(cpy, 0, size, array);
free(cpy);
}