GATE | GATE-CS-2005 | Question 7

The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be

(A) O (n)
(B) O (n log n)
(C) O(n3/2)
(D) O(n3)


Answer: (D)

Explanation: See question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-22/

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.