-
Notifications
You must be signed in to change notification settings - Fork 0
/
quicksort.c
80 lines (72 loc) · 1.61 KB
/
quicksort.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
#include <stdio.h>
#include <stdlib.h>
void print_arr(const int *arr, int n);
void scan_arr(int *arr, int n);
void quick_sort(int *arr, int n, int m);
void swap(int *a, int *b);
void selection_sort(int *arr, int n);
int main(){
int n, m;
scanf("%d", &n);
scanf("%d", &m);
int *arr = (int *) malloc(n * sizeof(int));
scan_arr(arr, n);
quick_sort(arr, n, m);
print_arr(arr, n);
free(arr);
return 0;
}
void print_arr(const int *arr, int n)
{
for (int i = 0; i < n; i++)
printf("%d ", arr[i]);
}
void scan_arr(int *arr, int n)
{
for (int i = 0; i < n; i++)
scanf("%d", arr + i);
}
void quick_sort(int *arr, int n, int m)
{
if (n < m)
selection_sort(arr, n);
else
{
int left = 0, right = n - 1, pivot = *(arr + n / 2);
while (left <= right)
{
while (arr[left] < pivot) left++;
while (arr[right] > pivot) right--;
if (left <= right){
swap(arr + left, arr + right);
left++;
right--;
}
}
quick_sort(arr, right + 1, m);
quick_sort(arr + left, n - left, m);
}
}
void selection_sort(int *arr, int n)
{
for (int i = 0; i < n - 1; i++)
{
int min = arr[i];
int i_min = i;
for (int j = i + 1; j < n; j++)
{
if (arr[j] < min){
min = arr[j];
i_min = j;
}
}
arr[i_min] = arr[i];
arr[i] = min;
}
}
void swap(int *a, int *b)
{
int buf = *a;
*a = *b;
*b = buf;
}