Today, we finish the lecture on Union Find. In the end of the class, we had a pretty complicate proof for the log*n running time. If you are confused, have a look at the following page
http://en.wikipedia.org/wiki/Proof_of_O(log*n)_time_complexity_of_Union_Find
The proof is not exactly accurate, but you can start read from the proof below the picture of many buckets.
No comments:
Post a Comment