Tri d’un tableau

#include <stdio.h>

int *exchange(int *tab, int a, int b)
{
    int temp = 0;
    temp = tab[a];
    tab[a] = tab[b];
    tab[b] = temp;
    return tab;
}

void print(int *tab, int size)
{
    for (int i = 0; i < size; i++)
    {
        printf("%d ", tab[i]);
    }
    printf("\n");
}

int *selection(int *tab, int size)
{
    int min = 0;
    for (int i = 0; i < size - 1; i++)
    {
        for (int j = i; j < size; j++)
        {
            if (tab[j] < tab[min])
            {
                min = j;
            }
        }
        tab = exchange(tab, i, min);
        min = i + 1;
    }
    return tab;
}

int main()
{
    int t[] = {6, 2, 3, 1, 5, 4};
    
    int size = sizeof t / sizeof (int);
    int *tab = selection(t, size);
    print(tab, size);

    return 0;
}