ISRO | ISRO CS 2018 | Question 77
The time complexity of computing the transitive closure of binary relation on a set of n elements is known to be
(B) O(n log n)
(C) O(n 3/2)
(D) O(n 3)
Explanation: Refer: GATE-CS-2005 | Question 7
Option (D) is correct.
Quiz of this Question