how to convert decimal number to binary

[saima]

a program that takes a decimal number input from the user and displays its binary number equivalent in 12 bits on the screen.

For example:
Enter a decimal number: 32
Its Binary Equivalent is : 000000100000

[rajesh6695]

a program that takes a decimal number input from the user and displays its binary number equivalent in 12 bits on the screen.

For example:
Enter a decimal number: 32
Its Binary Equivalent is : 000000100000

Do all process through recursive function....and print the values in the main function....

[vninja]

uhhhh stay away from recursive programming!!!! ! yea its easy but it eats up mem and cpu usage!!!!!
i.e.
go to a porn site (and turn your popup blocker off!!!).
this is what recursive programing does if each window was a recursive function call.

pretty much each time you call a function (lets say b) the calling function (lets say a) is put on hold.
therefor function a calls b and both are open until b closes/ends so that function a may continue. with recursion a calls a so a is put on hold while another instance of a is running. do this enough times and your comp will crash (well might as well).

i'd suggest a loop for this. something along the lines of

removed as per posting guidlines


the a%2 gives the remainder of number divided by 2.
num=b/2 decreases the number (moves over 1 bit) until num = 1 and the loop ends. this SHOULD give you a bin representation of the number. however its not going to be with 12 bits. try n figure out the rest if need furthur help post it up! gl

[cplusplusmasta1337]

removed as per posting guidlines


BOOYAH!!!!!1111 11 I AM TEH_MASTA1!11

[AdrianH]

removed as per posting guidlines


BOOYAH!!!!!1111 11 I AM TEH_MASTA1!11

Who apperently can't spell. ;) :D


Adrian

[Ganon11]

uhhhh stay away from recursive programming!!!! ! yea its easy but it eats up mem and cpu usage!!!!!

There are some problems that are just easier, conceptually and memory-wise, to solve with recursion. One example is traversing a binary tree - it's possible using loops, but I don't want to deal with all of that.

[AdrianH]

There are some problems that are just easier, conceptually and memory-wise, to solve with recursion. One example is traversing a binary tree - it's possible using loops, but I don't want to deal with all of that.

Further to what Ganon is saying, compiler optimisers nowadays can do some unrolling of recursion functions.


Adrian

[cplusplusmasta1337]

Again, code removed as per posting guidelines


BOOYA!!! 1337 PROGRAM RIGHT HERE. I spell fine.

Adrian.

[AdrianH]

Again, code removed as per posting guidelines


BOOYA!!! 1337 PROGRAM RIGHT HERE. I spell fine.

Adrian.

ROFLMAO L7


Adrian

[cplusplusmasta1337]

removed as per posting guidelines


Soak it in boys. Lookin's for free, touchin's gonna cost ya.
Copy & Paste this for TEH_1337 HAX!!!!

Adrian. are you drunk?
// Nope but this oughta do it.

[AdrianH]

removed as per posting guidelines


Soak it in boys. Lookin's for free, touchin's gonna cost ya.
Copy & Paste this for TEH_1337 HAX!!!!

Adrian. are you drunk?
// Nope but this oughta do it.

Whatever, you are banned for a week. Do it again and you will be banned permanently.


Adrian

[Silent1Mezzo]

Sigh, stupid people....They' ll never learn.

[Savage]

Sigh, stupid people....They' ll never learn.

Don't be rude and don't be a Savage

:)


Savage

[Plater]

If the input number is always going to contain the same number of bits, then you could just do an & operation for each bit (or iterate through the bits)

if (mydecimal&0x0004==0x0004)
{
//print a 1
}
else
{
//print a 0
}

if (mydecimal&0x0002==0x0002)
{
//print a 1
}
else
{
//print a 0
}
if (mydecimal&0x0001==0x0001)
{
//print a 1
}
else
{
//print a 0
}

[AdrianH]

If the input number is always going to contain the same number of bits, then you could just do an & operation for each bit (or iterate through the bits)

if (mydecimal&0x0004==0x0004)
{
//print a 1
}
else
{
//print a 0
}

if (mydecimal&0x0002==0x0002)
{
//print a 1
}
else
{
//print a 0
}
if (mydecimal&0x0001==0x0001)
{
//print a 1
}
else
{
//print a 0
}

Two problems with this. 1. prints out the digits backwards. 2. used copy coding methods which are prone to error.

Other than that, it great. ;)


Adrian