The time complexity of computing the transitive closure of binary relation on…
ISRO Scientist/Engineer SC · 2018 · Computer ScienceModified — slightly modified from the official paper; see the solutionGATE · 2005 · CSISRO Scientist/Engineer SC · May 2017 · Computer Science
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 3)
Attempted by 675 students.
Sign up free to check your answer
Sign up freeLoading lesson…