Reply To:

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 ³)

Home Modern › Forums › ISRO ›

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 ³)

› Reply To:

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 ³)