Question

program in Java or C

We read a number i and print all the bits in the binary representation of i+1 strictly to the right of the first 1. One option to of doing that is with a recursive function that checks if its argument is strictly greater than 1 and, if so, calls itself on j right-shifted 1 bit and then prints j mod 2.

Answer 1

// i have attached here the text and screenshot of the running code (recursive one).

// if you are satisfied with my contribution please give a like and if there is any problem please comment.
#include <stdio.h>
void input(int i)
{
printBinary(i+1);
}
void printBinary(int i)
{
if(i<=0)return;
printBinary(i>>1);
printf("%d",i&1);
}
int main()
{
input(9);
return 0;
}