Line | |
---|
1 | |
---|
2 | #define SIZE 5 |
---|
3 | |
---|
4 | char min (char tab[], char size, char n) { |
---|
5 | char i, min_index, min; |
---|
6 | |
---|
7 | if (size == 0) return 0; |
---|
8 | |
---|
9 | min_index = n; |
---|
10 | min = tab[min_index]; |
---|
11 | for (i = n+1 ; i < size ; i++) { |
---|
12 | if (tab[i] < min) { |
---|
13 | min_index = i; |
---|
14 | min = tab[min_index]; |
---|
15 | } |
---|
16 | } |
---|
17 | |
---|
18 | return min_index; |
---|
19 | } |
---|
20 | |
---|
21 | void swap (char tab[], char i, char j) { |
---|
22 | char t; |
---|
23 | t = tab[i] ; tab[i] = tab[j] ; tab[j] = t; |
---|
24 | } |
---|
25 | |
---|
26 | void bubble_sort(char tab[], char size) { |
---|
27 | char i, min_index; |
---|
28 | |
---|
29 | for (i = 0 ; i < size ; i++) { |
---|
30 | min_index = min(tab, size, i); |
---|
31 | swap(tab, i, min_index); |
---|
32 | } |
---|
33 | } |
---|
34 | |
---|
35 | int main () { |
---|
36 | char tab[] = {26, 21, 43, 62, 8}; |
---|
37 | |
---|
38 | bubble_sort(tab, SIZE); |
---|
39 | |
---|
40 | return (tab[3]); |
---|
41 | } |
---|
Note: See
TracBrowser
for help on using the repository browser.