slides/cours_3.md

 ---
-title: "Introduction aux algorithmes"
-date: "2023-10-03"
+title: "Introduction aux algorithmes III"
+date: "2024-09-30"
 ---
 
 # Rappel (1/2)
@@ -258,6 +258,7 @@ for (int i = 0; i < SIZE; ++i) {
     tab[i] = rand() / (double)RAND_MAX * 10.0 - 5.0; 
     // tab[i] contient un double dans [-5;5]
 }
+int other_tab[4] = {0}; // pareil que {0, 0, 0, 0}
 ```
 
 # Recherche du minimum dans un tableau (1/2)

slides/exemples/array.c

+#include <stdio.h>
+#include <strings.h>
+
+#define SIZE 4
+
+int main() {
+  int tab[SIZE] = {1, -1, 10, 4};
+  int new_tab[SIZE];
+  for (int index = 0; index < SIZE - 1; ++index) {
+
+    int min_index = index;
+    int min = tab[min_index];
+
+    for (int i = min_index + 1; i < SIZE; ++i) {
+      if (tab[i] < min) {
+        min = tab[i];
+        min_index = i;
+      }
+    }
+    new_tab[index] = min;
+  }
+  for (int i = 0; i < SIZE; ++i) {
+    printf("%d ", new_tab[i]);
+  }
+  printf("\n");
+}

slides/exemples/factorial.c

+#include <stdio.h>
+
+int factorial(int n) {
+    if (n > 1) {
+        return n * factorial(n - 1);
+    } else {
+        return 1;
+    }
+}
+
+int main() {
+    int n = 1000000000;
+    printf("%d! = %d\n", n, factorial(n));
+    return 0;
+}