Ziel: Optimalität | O(1) Zeit O(n) WORK |
i typisch: s= | 1 | |
2 |
p = \floor{ | n |
|
||||
m |
→ | log (n+1) | Zeit |
log (p+1) |
→Zeit = O( | log (n+1) |
|
||||||||||||
log (p+1) |
→ m·O( | n | ) = O(n) Work insgesamt |
m |
Sei Rang(bk : A) = j(i)+Rang(Bi:Aj) (i=\floor{ | k | }) |
√m |
WORK: | √m Pfeile √n Prozessoren |
O(√m·√n) Prozessoren Î O(n+m) WORK |
Ziel: Optimalität | O(log n) TIME O(n) WORK |
n | sortierte Elemente | |
log log n |
|A'| = Θ( | n | ) |
log log n |
n | sortierte Elemente | |
log log n |
|B'| = Θ( | n | ) |
log log n |
→ Work O(log log n | n | ) = O(n) |
log log n |
geht in O(log log | n | ) = O(log og n) Time |
log log n |