The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be:
(C) O(n ^ (3/2))
Explanation: See question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-22/
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.