The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________
Posted: Thu Jul 14, 2022 9:04 am
a) O(n)
b) O(logn)
c) O(n(n+(3/2)))
d) O(n3)
b) O(logn)
c) O(n(n+(3/2)))
d) O(n3)
Accurate answers. Every time.
https://answerhappy.com/