4 int min (int tab[], int size, int n) {
7 if (size == 0) return 0;
11 for (i = n+1 ; i < size ; i++) {
21 void swap (int tab[], int i, int j) {
23 t = tab[i] ; tab[i] = tab[j] ; tab[j] = t;
26 void bubble_sort(int tab[], int size) {
29 for (i = 0 ; i < size ; i++) {
30 min_index = min(tab, size, i);
31 swap(tab, i, min_index);
35 void print_tab (int tab[], int size) {
38 for (i = 0 ; i < size ; i++) {
46 int tab[SIZE] = {26, -21, 43, -62, 8};
48 bubble_sort(tab, SIZE);