### Time Complexity Analysis Of Union-Find Algorithm

April 20, 2017

We will here analyze the time complexity of the famous Union-Find algorithm which uses Path Compression And Union by Rank. We are going to assume that there are n vertices and m find operations . (Union operation is in fact two find operations and O(1) merging). We will give here one after one lemmas and … More Time Complexity Analysis Of Union-Find Algorithm