Predict the output of following program
C
#include <stdio.h>int f(int n){ if(n <= 1) return 1; if(n%2 == 0) return f(n/2); return f(n/2) + f(n/2+1);}int main(){ printf(\"%d\", f(11)); return 0;} |
(A)
Stack Overflow
(B)
3
(C)
4
(D)
5
Answer: (D)
Explanation:
On successive recursion F(11) will be decomposed into F(5) + F(6) -> F(2) + F(3) + F(3) -> F(1) + 2 * [F(1) + F(2)] -> 1 + 2 * [1 + F(1)] -> 1 + 2 * (1 + 1) -> 5.
Hence, option D is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Whether you’re preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, neveropen Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we’ve already empowered, and we’re here to do the same for you. Don’t miss out – check it out now!
… [Trackback]
[…] Find More Information here to that Topic: geeksforgeeks.org/algorithms-recursion-question-8-2/ […]
… [Trackback]
[…] Read More here to that Topic: geeksforgeeks.org/algorithms-recursion-question-8-2/ […]
… [Trackback]
[…] Read More on that Topic: geeksforgeeks.org/algorithms-recursion-question-8-2/ […]
… [Trackback]
[…] There you will find 73953 more Info to that Topic: geeksforgeeks.org/algorithms-recursion-question-8-2/ […]
… [Trackback]
[…] Info to that Topic: geeksforgeeks.org/algorithms-recursion-question-8-2/ […]
… [Trackback]
[…] Read More Info here on that Topic: geeksforgeeks.org/algorithms-recursion-question-8-2/ […]