/
100.c
114 lines (110 loc) · 1.97 KB
/
100.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
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define N 100
void init_array(int a[], int n);
void print_array(int a[], int n);
void bubble_array(int a[], int n);
void quick_sort(int a[], int x, int y);
void xuan_array(int a[], int n);
int main(int argc, const char *argv[])
{
int array[N];
init_array(array, N);
printf("The result :");
print_array(array, N);
// bubble_array(array, N);
// quick_sort(array, 0, N-1);
xuan_array(array, N);
printf("The sort:");
getchar();
print_array(array, N);
return 0;
}
void init_array(int a[], int n)
{
int i = 0;
srand(time(NULL));
for (i = 0; i < n; i++)
{
a[i] = rand()%100;
}
}
void print_array(int a[], int n)
{
int i = 0;
for (i = 0; i < n; i++)
{
if (i%10 == 0)
{
printf("\n");
}
printf("%5d", a[i]);
}
printf("\n");
}
void bubble_array(int a[], int n)
{
int i = 0;
int j = 0;
int t = 0;
for (i = 0; i < n-1; i++)
{
for (j = i+1; j < n; j++)
{
if (a[i] > a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
}
void quick_sort(int a[], int x, int y)
{
int i = x;
int j = y;
int t;
int mid = a[(x+y)/2];
while(i <= j)
{
while(a[i] < mid) i++;
while(a[j] > mid) j--;
if (i <= j)
{
t = a[i];
a[i] = a[j];
a[j] = t;
i++;
j--;
}
}
if (i < y)
{
quick_sort(a, i, y);
}
if (x < j)
{
quick_sort(a, x, j);
}
}
void xuan_array(int a[], int n)
{
int i = 0;
int j = 0;
int k = 0;
int t;
for (i = 0; i < n-1; i++)
{
k = i;
for (j = i+1; j < n; j++)
if(a[k] > a[j])
k = j;
{
t = a[i];
a[i] = a[k];
a[k] = t;
}
}
}