+1 vote
in Data Structures & Algorithms I by (110k points)
What is the worst case efficiency for a path compression algorithm?

(a) O(N)

(b) O(log N)

(c) O(N log N)

(d) O(M log N)

My doubt stems from Trees in section Trees of Data Structures & Algorithms I

This question was addressed to me in homework.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (d) O(M log N)

Best explanation: The worst case efficiency for a path compression algorithm is mathematically found to be O(M log N).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...