Sign in
Please select an account to continue using cracku.in
↓ →
The time complexity of computingthe transitive closure of binary relation on 2 Set Of m elements S known to be
$$O(n)$$
$$O(n * \log(n))$$
$$O(n^{\frac{3}{2}})$$
$$o(n^3)$$
Create a FREE account and get:
Terms of Service
CAT Formulas PDF CAT Exam Syllabus PDF CAT Study Plan PDF Cracku Brochure
Quick, Easy and Effective Revision
By proceeding you agree to create your account
Free CAT Formulas PDF will be sent to your email address soon !!!