2970b00318fab32b8dad73125dcbdfca62fdd698
[Algorithmic_C.git] / TP2 / exo3 / exo3.c
1 #include <stdio.h>
2
3 void permuter(int T[], int i1, int i2) {
4 int tmp = T[i1];
5 T[i1] = T[i2];
6 T[i2] = tmp;
7 }
8
9 void AfficheTab(int T[], int n) {
10 for (int i = 0; i < n; i++) {
11 printf("T[%d]=%d\n", i, T[i]);
12 }
13 }
14
15 void TriRapide(int T[], int n) {
16 int pivot = T[0];
17 int TP[n];
18 int TG[n];
19 int np = 0;
20 int ng = 0;
21
22 if (n == 1) {;}
23 else if (n == 2) {
24 if (T[0] > T[1]) { permuter(T, 0, 1); }
25 }
26 else if (n > 2) {
27 for (int i = 1; i < n; i++) {
28 if (T[i] < pivot) {
29 TP[np] = T[i];
30 np++;
31 } else {
32 TG[ng] = T[i];
33 ng++;
34 }
35 }
36 TriRapide(TP, np);
37 TriRapide(TG, ng);
38 for (int i = 0; i < np; i++) {
39 T[i] = TP[i];
40 }
41 T[np] = pivot;
42 for (int i = 0; i < ng; i++) {
43 T[np + 1 + i] = TG[i];
44 }
45 }
46 }
47
48 int main() {
49 int T[7] = {4, 2, 7, 3, 8, 6, 5};
50
51 AfficheTab(T, 7);
52
53 TriRapide(T, 7);
54
55 AfficheTab(T, 7);
56
57 return 0;
58 }