Merge sort: differenze tra le versioni

Versione delle 17:09, 18 feb 2009

Versione delle 15:41, 6 mar 2009

Riga 130:

while (j <= right) do

b[k] ← a[j]

j ← j + 1

k ← k + 1

end while

for k ← left to right do

a[k] ← b[k - left]

mergesort (a[], left, right)

if (left < right) then

center ← (left + right) / 2

mergesort(a, left, center)

mergesort(a, center+1, right)

merge(a, left, center, right)

== Analisi delle prestazioni ==