Open In App

Algorithms | Recursion | Question 3

What does the following function print for n = 25? 




void fun(int n)
{
  if (n == 0)
    return;
 
  printf(\"%d\", n%2);
  fun(n/2);

(A)



11001

(B)



10011

(C)

11111

(D)

00000


Answer: (B)
Explanation:

The function mainly prints binary representation in reverse order.  
And the binary representation of 25: 11001
its reverse is = 10011.

Hence (B) is the correct answer.

Quiz of this Question
Please comment below if you find anything wrong in the above post

Article Tags :