Informatique - T.D. No 7 Calcul de complexité

Téléchargement

o

i←1

p←0

i≤n

V[i] = elem

p←i

i←i+ 1

n

permut indmax

n−1 2 ∗(n−1) tripermutation

nc =Pn−1

j=1 j=n(n−1)

20

n−1

i ind

i←n

i > 1

ind ←indmax(V, i)

ind 6=i

permut(V, i, ind

i←i−1

i p

p←1

i←2

i≤n

V[i]≥V[p]

p←i

i←i+ 1

tmp :T

tmp ←V[i]

V[i]←V[j]

V[j]←tmp

i j

i←n

i > 1

j←1

j < i

V[j+ 1] < V [j]

permut(V, j, j + 1)

j←j+ 1

i←i−1

nc = (n−1)+(n−2)+..1 = n(n−1)

2

n(n−1)

2

n−i n −i

n−1

log2(n)

i j

i←n

permut ←V RAI

j←1

permut ←F AUX

j < i

V[j+ 1] < V [j]

permut ←V RAI

j←j+ 1

i←i−1

trouve ←F AU X

inf ←1

sup ←n

inf ≤sup

m←(inf +sup)/div2

V[m] = elem

trouve ←V RAI

V[m]< elem

inf ←m+ 1

sup ←m−1

1 / 4 100%