📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    âš¡ Month End Offer - Flat 52% Off On All Courses! Enroll Now âš¡
    00:00:00 AM Left

    Question

    Union-Find with path compression achieves nearly

    constant time because its complexity is:
    A O(log n) Correct Answer Incorrect Answer
    B O(√n) Correct Answer Incorrect Answer
    C O(α(n)) (inverse Ackermann) Correct Answer Incorrect Answer
    D O(n log n) Correct Answer Incorrect Answer
    E O(1) strictly Correct Answer Incorrect Answer

    Solution

    Union-Find with path compression and union by rank has amortized complexity α(n), which grows slower than log n.

    Practice Next
    ask-question