Q964
What is the time complexity of the following recursive implementation used to find the sum of the first n natural numbers? #include int recursive_sum(int n) if(n == 0) return 0; return n + recursive_sum(n - 1); int main() int n = 5; int ans = recursive_sum(n); printf("%d",ans); return 0;
A.
O(1)
B.
O(n)
AnswerC.
O(n2)
D.
O(n3)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board