how to convert decimal number to binary

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....

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

removed as per posting guidlines


BOOYAH!!!!!111111 I AM TEH_MASTA1!11

removed as per posting guidlines


BOOYAH!!!!!111111 I AM TEH_MASTA1!11

Who apperently can't spell. ;) :D


Adrian

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.

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

Again, code removed as per posting guidelines


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

Adrian.

Again, code removed as per posting guidelines


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

Adrian.

ROFLMAO L7


Adrian

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.

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

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

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

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

:)


Savage

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 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)

Expand|Select|Wrap|Line Numbers

1. if (mydecimal&0x0004==0x0004)
2. {
3. //print a 1
4. }
5. else
6. {
7. //print a 0
8. }
9.  
10. if (mydecimal&0x0002==0x0002)
11. {
12. //print a 1
13. }
14. else
15. {
16. //print a 0
17. }
18. if (mydecimal&0x0001==0x0001)
19. {
20. //print a 1
21. }
22. else
23. {
24. //print a 0
25. }
26.  

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

hehe actually if you look (and if I had added in a section for every bit) they would print out in the correct order.

And I never claimed to be good at c/c++, just saying it didn't look like anyone had given a solid answer to the post

bitset<length> myBinary ((long) <your number>) ;

cout<<myBinary;

bitset<length> myBinary ((long) <your number>) ;

cout<<myBinary;

Hey, didn't know that one. Learn something every day. ;)


Adrian

Hey, didn't know that one. Learn something every day. ;)


Adrian

I suppose that we exist to learn.

;)

Savage

bitset<length> myBinary ((long) <your number>) ;

cout<<myBinary;

GREAT: Two questions.
code for binary/hexadecimal/decimal <-->binary/hexadecimal/decimal.

bitset<length> myBinary ((long) <your number>) ;

cout<<myBinary;

GREAT: Two questions.
First, the code for binary/hexadecimal/decimal <-->binary/hexadecimal/decimal.

Second, is there a reference text/site which has indexed code snippets for math/engineering C++.

TIA

WestCoast101

GREAT: Two questions.
First, the code for binary/hexadecimal/decimal <-->binary/hexadecimal/decimal.

Second, is there a reference text/site which has indexed code snippets for math/engineering C++.

TIA

WestCoast101

The binary conversions should be above.
Hex is simple.
.ToString("X") on any integer will give you it's value as a hex string.
Int.Parse(string); is overloaded with a 2nd value stateing if it should accept a hex string or not.

The binary conversions should be above.
Hex is simple.
.ToString("X") on any integer will give you it's value as a hex string.
Int.Parse(string); is overloaded with a 2nd value stateing if it should accept a hex string or not.

Too bad this isn't C++.

Too bad this isn't C++.

Ooops, didn't notice what forum I was in. (got this outa control pannel)

I am "borrowing" this code from an embeded development helpfile and modifying it. My C is a little rusty

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

hi,
i am new to the forum can you suggest me how to send my queries and how to view the replies to my queries?

hi,
i am new to the forum can you suggest me how to send my queries and how to view the replies to my queries?

Hi,

You kindly read Posting Guidelines

Regards

< spoonfeeding code deleted >

You could repeatedly extract one nibble at a time from your value, using that nibble to index into an array of strings. The binary-string array contains 4-character strings such as "0000", "0001", etc. The hex-string array contains 1-character strings such as "0", "1", etc. Each such array has 16 entries.

How many nibbles are in the value? You either have to have secret knowledge of your compiler that you hard-code into your software or perhaps you could look at <limits.h> to see if your program can adapt itself to the compiler.

No one has mentioned an algorithm to solve this.

To check that a bit is set in a binary column, all you do is:

(32/32) = 1 and 1%2 is 1 the 32-bit is set
(32/16) = 2 and 2 % 2 is 0 the 16-bit is not set
etc...

@weaknessforcats
If you're using STL bitsets you can do myBitset.test(position);

I prefer looping over the number of bits and doing a check along the lines of
If that is true, then bit curbit is set (the least significant bit being bit 0). This is very similar to what weaknessforcats said, except that one is

:D

I believe itoa() with base 2 would be kinda spoiling the fun.
That, and you don't learn anything from it.

Here,a much easier way to convert decimal in to base-2,8,16-