#include #include #include #include #include "tableau.h" int position(int t[], int n, int valeur) { int i; for (i = 0; i < n; i++) if (t[i] == valeur) return i; assert(0); } int position_pair_impair(int t[], int n) { int i; for (i = 0; i < n/2; i++) if (t[i] % 2 == 0 && t[n - i - 1] % 2 == 1) return i; assert(0); } int medianne(int t[], int n) { float m = 0.0; int i; int median; assert(n > 0); for (i = 0; i < n; i++) m += t[i]; m /= n; median = t[0]; for (i = 0; i < n; i++) if (fabs(m - median) > fabs(m - t[i])) median = t[i]; return median; } int longueur_chemin(int t[], int n) { int lc = 0; int i = 0; while (i >= 0 && i < n) { lc += t[i]; i = t[i]; } return lc; } int main(int argc, char * argv) { int t[] = {1, 2, 3, 4, 5, 6}; printf("position : %d\n", position(t, 6, 3)); printf("pair-impair : %d\n", position_pair_impair(t, 6)); printf("medianne : %d\n", medianne(t, 6)); printf("longueur chemin : %d\n", longueur_chemin(t, 6)); exit(EXIT_SUCCESS); }