Skip to content
Related Articles

Related Articles

| | Question
  • Last Updated : 10 Jul, 2019

What is the worst case efficiency for a path compression algorithm?
(A) O(M log N)
(B) O(N log N)
(C) O(log N)
(D) O(N)


Answer: (A)

Explanation: The worst case efficiency for a path compression algorithm is mathematically found to be O(M log N).
Hence , option A is correct.

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up