From 0febb1daae7077017b30d5e76c81c522bd3c7b60 Mon Sep 17 00:00:00 2001
From: "jerome.maison" <jerome.maison@etu.hesge.ch>
Date: Tue, 24 Jan 2023 15:53:25 +0100
Subject: [PATCH] exo1
---
exo1/exo1.c | 35 ++++++++++++++++++++++++++++++++++-
1 file changed, 34 insertions(+), 1 deletion(-)
diff --git a/exo1/exo1.c b/exo1/exo1.c
index ae3f704..36b75ad 100644
--- a/exo1/exo1.c
+++ b/exo1/exo1.c
@@ -1,6 +1,39 @@
+// 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
--
GitLab