|
@ -7,30 +7,38 @@ |
|
|
|
|
|
|
|
|
int binaryStrLen(int input){ |
|
|
int binaryStrLen(int input){ |
|
|
int length = 0; |
|
|
int length = 0; |
|
|
|
|
|
|
|
|
if (input == 0) return 1; |
|
|
if (input == 0) return 1; |
|
|
|
|
|
// Length for sign bit, working with negative numbers: |
|
|
if (input < 0){ |
|
|
if (input < 0){ |
|
|
input *= -1; |
|
|
input *= -1; |
|
|
length += 1; |
|
|
length += 1; |
|
|
} |
|
|
} |
|
|
|
|
|
// Calculate length needed for binary string: |
|
|
for (int x = 0; x <= input; x++){ |
|
|
for (int x = 0; x <= input; x++){ |
|
|
if(pow(2,x) >= input + 1){ |
|
|
if(pow(2,x) >= input + 1){ |
|
|
length += x; |
|
|
length += x; |
|
|
break; |
|
|
break; |
|
|
} |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
return length; |
|
|
return length; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
char* convertIntToBinaryStr(int input){ |
|
|
char* convertIntToBinaryStr(int input){ |
|
|
int length = binaryStrLen(input); |
|
|
int length = binaryStrLen(input); |
|
|
int rest; |
|
|
int rest; |
|
|
|
|
|
|
|
|
char* result = (char*)malloc(sizeof(char) * length + 1); |
|
|
char* result = (char*)malloc(sizeof(char) * length + 1); |
|
|
if(result == NULL) return NULL; |
|
|
if(result == NULL) return NULL; |
|
|
|
|
|
// Add sign bit: |
|
|
if(input < 0){ |
|
|
if(input < 0){ |
|
|
result[0] = '-'; |
|
|
result[0] = '-'; |
|
|
input *= -1; |
|
|
input *= -1; |
|
|
} |
|
|
} |
|
|
|
|
|
// Terminate string: |
|
|
result[length] = '\0'; |
|
|
result[length] = '\0'; |
|
|
|
|
|
// Algorithm to build binary string: |
|
|
do{ |
|
|
do{ |
|
|
rest = input % 2; |
|
|
rest = input % 2; |
|
|
input /= 2; |
|
|
input /= 2; |
|
@ -38,6 +46,7 @@ char* convertIntToBinaryStr(int input){ |
|
|
if(rest == 0) result[length - 1] = '0'; |
|
|
if(rest == 0) result[length - 1] = '0'; |
|
|
length--; |
|
|
length--; |
|
|
}while(input != 0); |
|
|
}while(input != 0); |
|
|
|
|
|
|
|
|
return result; |
|
|
return result; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
@ -45,32 +54,40 @@ unsigned int convertBinaryStrToInt(char* input){ |
|
|
unsigned int result = 0; |
|
|
unsigned int result = 0; |
|
|
int index = strlen(input) - 1; |
|
|
int index = strlen(input) - 1; |
|
|
int exponent = 0; |
|
|
int exponent = 0; |
|
|
|
|
|
// Algorithm to calculate number for given binary string: |
|
|
while(index >= 0){ |
|
|
while(index >= 0){ |
|
|
if(input[index] == '1') result += 1 * pow(2, exponent); |
|
|
if(input[index] == '1') result += 1 * pow(2, exponent); |
|
|
index--; |
|
|
index--; |
|
|
exponent++; |
|
|
exponent++; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
return result; |
|
|
return result; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
int hexStrLen(const int input){ |
|
|
int hexStrLen(const int input){ |
|
|
int length = 0; |
|
|
int length = 0; |
|
|
|
|
|
|
|
|
if(input == 0) return 1; |
|
|
if(input == 0) return 1; |
|
|
|
|
|
// Calculate length needed for hexadecimal string: |
|
|
for (int x = 0; x <= input; x++){ |
|
|
for (int x = 0; x <= input; x++){ |
|
|
if(pow(16,x) >= input + 1){ |
|
|
if(pow(16,x) >= input + 1){ |
|
|
length += x; |
|
|
length += x; |
|
|
break; |
|
|
break; |
|
|
} |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
return length; |
|
|
return length; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
char* convertIntToHex(int input){ |
|
|
char* convertIntToHex(int input){ |
|
|
int length = hexStrLen(input); |
|
|
int length = hexStrLen(input); |
|
|
int rest; |
|
|
int rest; |
|
|
|
|
|
|
|
|
char* result = (char*)malloc(sizeof(char) * length + 1); |
|
|
char* result = (char*)malloc(sizeof(char) * length + 1); |
|
|
if(result == NULL) return NULL; |
|
|
if(result == NULL) return NULL; |
|
|
|
|
|
// Terminate string: |
|
|
result[length] = '\0'; |
|
|
result[length] = '\0'; |
|
|
|
|
|
// Algorithm to build hexadecimal string: |
|
|
do{ |
|
|
do{ |
|
|
rest = input % 16; |
|
|
rest = input % 16; |
|
|
input /= 16; |
|
|
input /= 16; |
|
@ -85,6 +102,7 @@ char* convertIntToHex(int input){ |
|
|
} |
|
|
} |
|
|
length--; |
|
|
length--; |
|
|
}while(input != 0); |
|
|
}while(input != 0); |
|
|
|
|
|
|
|
|
return result; |
|
|
return result; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
@ -92,6 +110,7 @@ unsigned int convertHexStrToInt(char* input){ |
|
|
unsigned int result = 0; |
|
|
unsigned int result = 0; |
|
|
int index = strlen(input) - 1; |
|
|
int index = strlen(input) - 1; |
|
|
int exponent = 0; |
|
|
int exponent = 0; |
|
|
|
|
|
// Algorithm to calculate number for given hexadecimal string: |
|
|
while(index >= 0){ |
|
|
while(index >= 0){ |
|
|
switch(input[index]){ |
|
|
switch(input[index]){ |
|
|
case 'A': case 'a': result += 10 * pow(16, exponent); break; |
|
|
case 'A': case 'a': result += 10 * pow(16, exponent); break; |
|
@ -105,5 +124,6 @@ unsigned int convertHexStrToInt(char* input){ |
|
|
index--; |
|
|
index--; |
|
|
exponent++; |
|
|
exponent++; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
return result; |
|
|
return result; |
|
|
} |
|
|
} |