CAT 2024 Last Batch ๐งโ๐ Starts on Monday (22nd July). Enroll now
Edit MetaData
What is the time complexity for the following C module? Assume that n > 0;int module(int n){ if( n == 1) return 1; else return (n + module(n-1));}
$$O(n)$$
$$O(\log n)$$
$$O(n^2)$$
$$O(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 !!!