Merge sort: differenze tra le versioni

Versione delle 00:44, 8 giu 2007

Versione delle 13:14, 8 giu 2007

Riga 61:

b[k] = a[j]

j ← j + 1

k ← k + 1

end while

while (i <= center) do

b[k] ← a[i]

j ← j + 1

k ← k + 1

end while

while (j <= right) do

b[k]while ← a[(j] <= right) do

jb[k] ← a[j] + 1

kj ← kj + 1

k ← k + 1

for k ← leftend to right dowhile

a[k] ← b[k - left]

for k ← left to right do

a[k] ← b[k - left]

mergesort (a[], left, right)