1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
| void permutation(int tab[],int i, int j)
{
int temp = 0;
temp = tab[i];
tab[i]=tab[j];
tab[j]=temp;
}
void tamiser(int tab[], int noeud, int n)
{
int k = noeud;
int j = 2*k;
while(j<=n)
{
if (j<n && tab[j]<tab[j+1])
{
j++;
}
if (tab[k]<tab[j])
{
permutation(tab,k,j);
k = j;
j = 2*k;
}
else return;
}
}
void tri(int tab[], int n)
{
for (int i = n/2; i>0;i--)
{
tamiser(tab,i,n);
}
for (int i=n; i>1;i-- )
{
permutation(tab,i,1);
tamiser(tab,1,i);
}
} |
Partager