2 fixed the link
source | link

The signed integers are stored using http://nl.wikipedia.org/wiki/Two%27s_complementhttp://en.wikipedia.org/wiki/Two%27s%20complement

Then you get :

000   0
001   1
010   2
011   3
100   -4
101   -3
110   -2
111   -1

Basically it's very easy counting, you count till half the max of the signed integer. Do a +1, make it negative and start counting down.

The signed integers are stored using http://nl.wikipedia.org/wiki/Two%27s_complement

Then you get :

000   0
001   1
010   2
011   3
100   -4
101   -3
110   -2
111   -1

Basically it's very easy counting, you count till half the max of the signed integer. Do a +1, make it negative and start counting down.

The signed integers are stored using http://en.wikipedia.org/wiki/Two%27s%20complement

Then you get :

000   0
001   1
010   2
011   3
100   -4
101   -3
110   -2
111   -1

Basically it's very easy counting, you count till half the max of the signed integer. Do a +1, make it negative and start counting down.

1
source | link

The signed integers are stored using http://nl.wikipedia.org/wiki/Two%27s_complement

Then you get :

000   0
001   1
010   2
011   3
100   -4
101   -3
110   -2
111   -1

Basically it's very easy counting, you count till half the max of the signed integer. Do a +1, make it negative and start counting down.