CAT 2024 Last Batch ๐งโ๐ Starts on Monday (22nd July). Enroll now
Edit MetaData
Consider the recurrence equation$$T(n) = \begin{cases}2T(n - 1), & if n> 0\\1 & otherwise\end{cases}$$Then T(n) is (in big O order)
$$O(n)$$
$$O(2^n)$$
$$O(1)$$
$$O(\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!
Day-wise Structured & Planned Preparation Guide
By proceeding you agree to create your account
Free CAT Schedule PDF will be sent to your email address soon !!!