From b225c20b2b0e81d22d7aa91de62edd4a86f3850c Mon Sep 17 00:00:00 2001
From: Geoffrey Frogeye <geoffrey@frogeye.fr>
Date: Wed, 9 Mar 2016 08:36:37 +0100
Subject: [PATCH] TP3 E4

---
 TP3/E2.c |  2 --
 TP3/E3.c |  1 +
 TP3/E4.c | 26 ++++++++++++++++++++++++++
 3 files changed, 27 insertions(+), 2 deletions(-)
 create mode 100644 TP3/E4.c

diff --git a/TP3/E2.c b/TP3/E2.c
index 6ae3648..9db59e1 100644
--- a/TP3/E2.c
+++ b/TP3/E2.c
@@ -55,7 +55,5 @@ int main() {
 
     printf("Résultat : %d\n", res);
 
-
-
     return 0;
 }
diff --git a/TP3/E3.c b/TP3/E3.c
index 5190f3c..2dab02a 100644
--- a/TP3/E3.c
+++ b/TP3/E3.c
@@ -33,4 +33,5 @@ int main() {
     }
     printf("Moyenne : %lf\n", moyenne(n, T));
     printf("Maximum : %lf\n", maximum(n, T));
+    return 0;
 }
diff --git a/TP3/E4.c b/TP3/E4.c
new file mode 100644
index 0000000..45c0c88
--- /dev/null
+++ b/TP3/E4.c
@@ -0,0 +1,26 @@
+/* Recherche d'éléments sur critère */
+
+#include <stdio.h>
+
+int recherche(int n, double T[n]) {
+    int i;
+    for (i = 0; i < n; i++) {
+        if (T[i] < 0) {
+            return i;
+        }
+    }
+    return -1;
+}
+
+int main() {
+    int n, i;
+    printf("Nombre de nombres ? ");
+    scanf("%d", &n);
+    double T[n];
+    for (i = 0; i < n; i++) {
+        printf("Saisir le nombre %d : ", i+1);
+        scanf("%lf", &T[i]);
+    }
+    printf("Recherche : %lf\n", recherche(n, T)+1);
+    return 0;
+}