1 for j := 1 to n pardo B[0,j]:=A[j] 2 for h := 1 to log(n) do // h = Höhe |
||||
for j := 1 to | n | pardo | ||
2h | ||||
B(h,j):=B(h-1,2j-1)+B(h-1,2j) // Bearbeitung innerhalb eines Baum-Niveau | ||||
3 for h := log(n) to 0 do | ||||
for j:=1.. | n | pardo // für jeden Knoten des Levels h | ||
2h | ||||
if (j gerade) then C(h,j):=C(h+1,j/2) | ||||
elseif (j>1 ungerade) then C(h,j:=Ch+1, | j-1 | ) + B(h,j) else C(h,1):=B(h,1) // wenn j=1 | ||
2 |
T(n) = T( | n | ) + a = O(log n) |
2 |
W(n) = W( | n | ) + b· n = O(n) |
2 |