CareerCup

int binary(int n)
{
if(n==0)
return 0;
else
{
binary(n/2);
printf("%d",n%2);
}

return 0;
}

I may not understand the question properly. I think following java code can solve this problem.
public static String toBinaryString(int k) {
if (k == 1) {
return String.valueOf(k);
} else {
return toBinaryString(k / 2) + k % 2;
}
}
Please correct and help me solve it out.

Recursion will help here

void PrintBinary(int n)
{
if(n!=0)
{
PrintBinary(n/2);
printf("%c", (n%2)+'0');
}

}

public class Amazon2{
	public static void main(String args[])
	{
		int n =5;
		printBinary(n);
	}
	private static void printBinary(int n)
	{
		if(n==0) return;
		printBinary(n/2);
		System.out.print(n%2);
	}
}

Wont this print out the reverse of the binary number?
I mean if 12 is 1100 then wouldn't the program print 0011???

How about this solution

public class Binary {
	public static void main(String[] args) {
                //Read in the variable somehow
		int var = 34;

		printVar(var);
	}

	private static void printVar(int var) {
		if (var == 1) {
			System.out.print(var);
		} else {
			printVar(var >> 1);
			System.out.print(var & 1);
		}
	}
}

All are writing same code, same logic, and adding one their own trademark defect. For instance - function returning integer doesn't return anything.

I believe we are good to close this thread and all understand the solution.

Thanks
Ankush

int binary(int n)
{
	if(n==0||n==1) cout << n;
	else
	{
		binary(n/2);
		cout << n%2;
	}
}

How bout this code.....

#include<stdio.h>

void Print_Binary(int);

void Print_Binary(int n)
{
if(n>=2)
Print_Binary(n/2);
printf("%d",n%2);
}

main()
{
int n;
printf("Enter the value of n\n");
scanf("%d",&n);
Print_Binary(n);
getch();
}

i agree with ankushbindlish..all codes are same and they all have same bug..that is for n=10,the output is in reverse order instead of the correct output..give a solution which will give correct output..

say the integer has 32 bits.

unsigned int mask = (1 << 31);
while(mask > 0) {
print mask & num ? '1' : '0';
mask >> 1;
}

@anant- Are you nuts? the o/p for the recursion procedure is in the correct order...

Everyone is providing the correct solution in different languages. The key point here is Recursion calling of the same function by dividing the number by 2 and passing the same. I think we can close the thread