| Remember Union/Find |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Worst-case
time for a sequence of n operations |
||||||||||||
| (starting
from singletons) is O(n a(n)) |
|||||||||||||
| • | This
bound is too hard to prove for this course, but |
||||||||||||
| we
can use amortization to prove a bound that is |
|||||||||||||
| almost
as good: |
|||||||||||||
| – | Worst-case
time for a sequence of n operations (starting |
||||||||||||
| from
singletons) is O(n log*n) |
|||||||||||||
| – | log*n
does not grow as slowly as a(n), but it is less than |
||||||||||||
| about 5
for all reasonable inputs |
|||||||||||||
| CS409 - Spring
2000 |
| 8 |