3 int rechercheDicho(int e
, int T
[], int d
, int f
) {
5 if (f
< d
) {return -1;}
7 if (T
[m
] == e
) {return m
;}
9 return rechercheDicho(e
, T
, d
, m
-1);
11 return rechercheDicho(e
, T
, m
+1, f
);
16 int T
[9] = {1, 2, 3, 6, 6, 7, 9, 11, 12};
18 int result
= rechercheDicho(8, T
, 0, 9);
21 printf("element present a index=%d\n", result
);
23 printf("element non present\n");