CAT 2024 Last Batch ๐งโ๐ Starts on Monday (22nd July). Enroll now
Edit MetaData
Consider the programvoid function (int n) { int i, j, count = 0; for (i = n/2; i <= n; i++) for (j = 1; j <= n; j = j * 2) count++;}The complexity of the program is
$$O(\log n)$$
$$O(n^2)$$
$$O(n^2 \log n)$$
$$O(n \log n)$$
Create a FREE account and get:
Login to your Cracku account.
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Quick, Easy and Effective Revision
By proceeding you agree to create your account
Free CAT Formulae PDF will be sent to your email address soon !!!