Skip to content
Related Articles
Open in App
Not now

Related Articles

ISRO | ISRO CS 2018 | Question 77

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 06 Jul, 2018
Improve Article
Save Article

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




O(n log n)


O(n 3/2)


O(n 3)

Answer: (D)


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
Related Articles

Start Your Coding Journey Now!