Add TP2 exercice 1, the sorting algorithm SelectionSwap.

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

diff --git a/TP2/exo1/exo1.c b/TP2/exo1/exo1.c
new file mode 100644 (file)
index 0000000..27ff6b9
--- /dev/null
+++ b/TP2/exo1/exo1.c
@@ -0,0 +1,44 @@
+#include <stdio.h>
+
+void permuter (int T[], int n, int i1, int i2) {
+    int tmp = T[i1];
+    T[i1] = T[i2];
+    T[i2] = tmp;
+}
+
+int i_min(int T[], int n, int d) {
+    int min = d;
+    for (int i = d+1; i < n; i++) {
+        if (T[i] < T[min]) {
+            min = i;
+        }
+    }
+    return min;
+}
+
+void SelecEch(int T[], int n) {
+    int imin, d = 0;
+    while (d < n-1) {
+        imin = i_min(T, n, d);
+        permuter(T, n, d, imin);
+        d++;
+    }
+}
+
+void AfficheTab(int T[], int n) {
+    for (int i = 0; i < n; i++) {
+        printf("valeur a index=%d=%d\n", i, T[i]);
+    }
+}
+
+int main() {
+    int T[6] = {2, 5, 3, 1, 4, 6};
+
+    AfficheTab(T, 6);
+
+    SelecEch(T, 6);
+    
+    AfficheTab(T, 6);
+
+    return 0;
+}