Untitled
plain_text
a month ago
788 B
2
Indexable
Never
void ft_sort_int_tab(int *tab, int size) { int i; i = 0; while (i < size - 1) { int min_index = i; int j = i + 1; while (j < size) { if (tab[j] < tab[min_index]) { min_index = j; } j++; } if (min_index != i) { ft_swap(&tab[i], &tab[min_index]); } i++; } } void ft_swap(int *a, int *b) { int temp; temp = *a; *a = *b; *b = temp; } #include <stdio.h> int main() { int arr[] = {9,5,6,4,2}; int size = sizeof(arr) / sizeof(arr[0]); for (int i = 0; i < size; i++) { ft_sort_int_tab(arr, size); printf("%d ", arr[i]); } return 0; }