/
quick_sort.c
106 lines (89 loc) · 1.25 KB
/
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
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
#include "stdio.h"
#include <time.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
void generate_array(char arr[],int n)
{
int i;
srand(time(0));
for (int i = 0; i < n; ++i)
{
arr[i] = rand();
}
}
void _printf(char arr[], int length)
{
printf("-----------------------\n");
for (int i = 0; i < length; i++)
{
printf("%d\n",arr[i]);
}
printf("-----------------------\n");
}
int adjust_array(int arr[], int l, int r)
{
int i = l, j = r;
int x = arr[i];
while(i < j)
{
while((i<j) && (arr[j] > x))
j--;
if (i < j)
{
arr[i] = arr[j];
i++;
}
while((i<j) && (arr[j] > x))
i++;
if (i < j)
{
arr[j] = arr[i];
j--;
}
}
arr[i] = x;
return i;
}
void quick_sort(char arr[],int l, int r)
{
if(l < r)
{
int i=l,j=r,x = arr[i];
while(i < j)
{
while((i<j) && (arr[j]>x))
{
j--;
}
if (i < j)
{
arr[i] = arr[j];
i++;
}
while((i<j) && arr[i] < x)
{
i++;
}
if (i < j)
{
arr[j] = arr[i];
j--;
}
arr[i] = x;
quick_sort(arr,l,i-1);
quick_sort(arr,i+1,r);
}
}
}
int main(void)
{
char arr[100];
int n = 100;
memset(arr,0,n);
_printf(arr,n);
generate_array(arr, n);
quick_sort(arr,0,99);
_printf(arr,n);
printf("hello\n");
}