🏁 Starts from Monday (6th Feb) 👉 Enroll to CAT 2023 nine months batch here
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:
Ask doubts feature is currently unavailable for you. You can reach us at support@cracku.in for any further details/doubts.
Boost your Prep!