-
Notifications
You must be signed in to change notification settings - Fork 5
/
3-quick_sort.c
executable file
·69 lines (62 loc) · 1.21 KB
/
3-quick_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
#include "sort.h"
/**
* partition - array partition
* @array: array to sort
* @first: first position
* @last: last position
* @size: array size
* Return: int pivot index
*/
int partition(int *array, int first, int last, size_t size)
{
int i = first - 1, aux, j;
for (j = first; j <= last - 1; j++)
{
if (array[j] < array[last])
{
i++;
if (i < j)
{
aux = array[i];
array[i] = array[j];
array[j] = aux;
print_array(array, size);
}
}
}
if (array[i + 1] > array[last])
{
aux = array[i + 1];
array[i + 1] = array[last];
array[last] = aux;
print_array(array, size);
}
return (i + 1);
}
/**
* qs - sorts an array of integers recursively
* @array: array to sort
* @first: first position
* @last: last position
* @size: array size
*/
void qs(int *array, int first, int last, size_t size)
{
int pivot;
if (first < last)
{
pivot = partition(array, first, last, size);
qs(array, first, pivot - 1, size);
qs(array, pivot + 1, last, size);
}
}
/**
* quick_sort - sorts an array of integers using the Quick
* sort algorithm in ascending order
* @array: array to sort
* @size: array size
*/
void quick_sort(int *array, size_t size)
{
qs(array, 0, size - 1, size);
}