Академический Документы
Профессиональный Документы
Культура Документы
Selección
Bubble
Shell
MergeSort
CountingSort
Max-Heapify[2](A, i, lon)
{
izq = 2*i;
der = 2*i + 1;
if (izq ≤ lon && A[izq] > A[i])
mayor = izq
else
mayor = i
if (der ≤ lon && A[der] > A[mayor])
{
mayor = der;
if (mayor <> i)
swap(A,i,mayor)
Max-Heapify(A, mayor, long)
}
}
--------------------
Build-Max-Heap(A, lon)
{
for i = floor(lon/2) downto 1 do
Max-Heapify(A, i)
}
--------------------
Heap-Increase-Key(A, i, key)
{
A[i]=key;
while (i>1 && a[padre(i)] < a[i])
{
Swap(A,i,padre(i));
i = padre(i)
}
}