I know this is probably a stupid question...
x636F 6465 => Hex number
Can I look at each number/letter individually and write the corresponding decimal value? Since F is the only value which won't be identical, can I just insert 15 (it's corresponding decimal value) and have the number in decimal form? I want to convert it into binary....
Not stupid - but perhaps poorly phrased.Originally Posted by John_L
You can do anything you want. What's your overall objective?x636F 6465 => Hex number
Can I look at each number/letter individually and write the corresponding decimal value?
Huh? Not sure I understand this. If I follow your logic, why isn't the 3 also unique???Since F is the only value which won't be identical,...
Well, F is 15, if it's in the lowest nibble....can I just insert 15 (it's corresponding decimal value) and have the number in decimal form?
Then all you need are bit patterns to replace the values. A little tight loop that spits out a 1 or a 0 based on the result of a BITWISE AND should work nicely. Test, output the 1 or 0, shift, repeat.I want to convert it into binary....
Todd
What about negative numbers if I were to use two's complement? -1 or -432 in hexadecimal form? I have the algorithm down for positive decimal numbers to hex and binary...not sure about the negative ones for hex though (binary is easy).
What do you care about negative numbers when converting from a base 16 representation of a base 2 number system?
Here's a way to convert a negative decimal number to a two-complement's hexadecimal representationExample with another numberCode:-1 = < take the absolute value of -1, which is 1 > 1 = < transform it in hexadecimal > 0x0001 (let's say we are working with 16-bits words) = < negate (one complement or 15 complement if you are staying in base 16) > 0xFFFE = < add 1> 0xFFFF
Code:-473 = 473 = 0x01D9 = 0xFE26 = 0xFE27
What does decimal have to do with anything? Anyway, hex to binary is easy enough to do in your head: 636F6465 = 01100011011011110110010001100101
