Integers near zero

[Ismael Upright]

Hello,

I have a question about how do integers look like near zero. I mean when they are written bit by bit.

Integers are 32-bit and one of them is the sign bit.

Does it look like that?

1000 0000 0000 0000 0000 0000 0000 0011 //This is int == -4
1000 0000 0000 0000 0000 0000 0000 0010 //This is int == -3
1000 0000 0000 0000 0000 0000 0000 0001 //This is int == -2
1000 0000 0000 0000 0000 0000 0000 0000 //This is int == -1
0000 0000 0000 0000 0000 0000 0000 0000 //This is int == 0
0000 0000 0000 0000 0000 0000 0000 0001 //This is int == 1
0000 0000 0000 0000 0000 0000 0000 0010 //This is int == 2
0000 0000 0000 0000 0000 0000 0000 0011 //This is int == 3


(I grouped them in fours to make them easier to read)

[Imran Jack]

Yes, I think so....

[Jesper de Jong]

Java stores integers in two's complement format - see that page for a detailed explanation.

You've got the negative numbers wrong.

-1 = 1111 1111 1111 1111 1111 1111 1111 1111
-2 = 1111 1111 1111 1111 1111 1111 1111 1110
etc.
[ May 18, 2008: Message edited by: Jesper Young ]

[Deepak Bala]

Originally posted by Imran Jack:
Yes, I think so....

Not so sure about that. 2's complement method is what most use. Here is a link to help you out

http://heather.cs.ucdavis.edu/~matloff/UnixAndC/CLanguage/Bits.html

However, this has nothing to do with the SCJP