Ako je 'if the least significant bit is set then...' onda je to neki pozitivan broj
Ako je 'if the most significant bit is set then...' onda je to neki negativni broj
Na primer:
INT_MAX = 11111111111111111111111111111110 = 2147483647
INT_MAX = 2^0*1 + 2^1*1 + .... + 2^32*0
INT_MIN = 00000000000000000000000000000001 = -2147483648
INT_MIN = 2^0*0 + .... + 2^32*1
Evo ti jedan mali program napisan na brzaka koji ti omogucava da vidis bilo koji broj u binarnom obliku:
Code:
#include <stdio.h>
#include <limits.h>
#define TEST_BIT(num, x) (num & (1 << (x - 1))) ? 1:0
int main()
{
int i;
int max = INT_MAX;
int min = INT_MIN;
for(i = 1; i <= 32; i++)
printf("%d", TEST_BIT(max, i));
printf("\n%d\n", max);
for(i = 1; i <= 32; i++)
printf("%d", TEST_BIT(min, i));
printf("\n%d\n", min);
return(0);
}
"The problem with the world is that everyone is a few drinks behind."
-Humphrey Bogart
API return value
