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

(A)

O(n)

(B)

O(n log n)

(C)

O(n ^3/2)

(D)

O(n ³)

Answer: (D)

Explanation:

Refer: GATE-CS-2005 | Question 7 Option (D) is correct.

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

My Personal Notes arrow_drop_up

Save