Forked from
algorithmique / cours
764 commits behind the upstream repository.
-
orestis.malaspin authoredorestis.malaspin authored
tri.c 782 B
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define SIZE 10
void find_min(double tab[], int i0, int *ind, double *min) {
*min = tab[i0];
*ind = i0;
for (int i = i0 + 1; i < SIZE; ++i) {
if (*min > tab[i]) {
*ind = i;
*min = tab[i];
}
}
}
int main() {
srand(time(NULL));
double tab[SIZE];
for (int i = 0; i < SIZE; ++i) {
tab[i] = rand() / (double)RAND_MAX;
}
for (int i = 0; i < SIZE - 1; ++i) {
double min = tab[i];
int ind_min = i;
find_min(tab, i, &ind_min, &min);
double tmp = tab[i];
tab[i] = min;
tab[ind_min] = tmp;
}
for (int i = 0; i < SIZE; ++i) {
printf("%f ", tab[i]);
}
printf("\n");
}