Reviews de code - TP 1

void print_laby(int n, int m, char** A) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            printf("%c", A[i][j]);
        }
        printf("\n");
    }
    printf("\n");
}

int eratosthene(int n)
{
    int *nums = malloc((n - 1) * sizeof(int));
    int pi = 0;

    for (int i = 0; i < n - 1; i++)
    {
        int x = i + 2;
        if (nums[i] != -1)
        {
            nums[i] = x;
            pi++;
            printf("%d ", x);
        }

        for (int j = 1; j * x - 2 < n - 1; j++)
            nums[j * x - 2] = -1;
    }

    free(nums);
    printf("\n");
    return pi;
}

int somme(int tab[], int taille)
{
    int acc = 0;
    for (int i = 0; i < taille; i++)
        acc += tab[i];
    return acc;
}

int somme(int tableau[], int taille) {
    int i ;
    int accumulateur ;
    accumulateur = 0 ;
    for (i=0 ; i<taille ; i++) {
        accumulateur = accumulateur + tableau[i] ;
    }
    return accumulateur ;
}

bool est_vide_liste(liste *lst){
    return lst->start == NULL;
}