exo1

exo1/exo1.c

+// Intersection de listes chaînées
 #include <stdio.h>
 #include <stdlib.h>
 
+int sorted_list(int lenA, int lenB, int *listA, int *listB){
+    int out_chaine[lenA + lenB];
+    for(int i = 0; i < (lenA + lenB); i += 2){
+        out_chaine[i] = listA[i];
+        out_chaine[i + 1] = listB[i];
+    }
+    return out_chaine[lenA + lenB];
+}
+
 int main() {
-    return 0;
+    int lenA;
+    int val1A;
+    int val2A;
+    int val3A;
+    int val4A;
+    printf("Entrez la liste:");
+    scanf("%d %d %d %d %d", &lenA, &val1A, &val2A, &val3A, &val4A);
+
+    int lenB;
+    int val1B;
+    int val2B;
+    int val3B;
+    int val4B;
+    printf("Entrez la liste:");
+    scanf("%d %d %d %d %d", &lenB, &val1B, &val2B, &val3B, &val4B);
+
+    int listA[] = {val1A, val2A, val3A, val4A};
+    int listB[] = {val1B, val2B, val3B, val4B};
+
+    int inter[lenA + lenB];
+    inter[lenA + lenB] = sorted_list(lenA, lenB, *listA, *listB);
+    for(int i = 0; i < (lenA + lenB); ++i){
+        printf("%d", inter[i]);
+    }
 }
\ No newline at end of file