Grand India Independence day sale (Aug 10-12) 🇮🇳 Get upto 75% Off on CAT courses now
The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be
$$O(n \log n)$$
Create a FREE account and get:
Ask doubts feature is currently unavailable for you. You can reach us at firstname.lastname@example.org for any further details/doubts.
Boost your Prep!