TP2 exo3: Add quick sort implementation.

[Algorithmic_C.git] / TP2 / exo1 / exo1.c

diff --git a/TP2/exo1/exo1.c b/TP2/exo1/exo1.c
index 25d6c99922febc0c77a97c4a241a3892fc642f50..514f794c86b56a53ef381413b161173ff5875aff 100644 (file)
--- a/TP2/exo1/exo1.c
+++ b/TP2/exo1/exo1.c
@@ -1,6 +1,6 @@
 #include <stdio.h>
 
-void permuter (int T[], int i1, int i2) {
+void permuter(int T[], int i1, int i2) {
     int tmp = T[i1];
     T[i1] = T[i2];
     T[i2] = tmp;
@@ -27,7 +27,7 @@ void SelecEch(int T[], int n) {
 
 void AfficheTab(int T[], int n) {
     for (int i = 0; i < n; i++) {
-        printf("valeur a index=%d=%d\n", i, T[i]);
+        printf("T[%d]=%d\n", i, T[i]);
     }
 }