void fun(int n) { Stack S; // Creates an empty stack while (n > 0) { // This…
void fun(int n)
{
Stack S; // Creates an empty stack
while (n > 0)
{
// This line pushes the value of n%2 to stack S
push(&S, n % 2);
n = n / 2;
}
// Run while Stack S is not empty
while (!isEmpty(&S))
printf("%d ", pop(&S)); // pop an element from S and print it
}
- A.
Prints binary representation of n in reverse order
- B.
Prints binary representation of n
- C.
Prints the value of Logn
- D.
Prints the value of Logn in reverse order
Attempted by 319 students.
Sign up free to check your answer
Sign up freeLoading lesson…