Sign in
Please select an account to continue using cracku.in
↓ →
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)$$
$$O(n^{\frac{3}{2}})$$
$$O(n^{3})$$
$$O(n)$$
Create a FREE account and get:
Terms of Service
CAT Formulas PDF CAT Exam Syllabus PDF CAT Study Plan PDF Cracku Brochure