How to resolve the algorithm Non-decimal radices/Convert step by step in the HicEst programming language
How to resolve the algorithm Non-decimal radices/Convert step by step in the HicEst programming language
Table of Contents
Problem Statement
Number base conversion is when you express a stored integer in an integer base, such as in octal (base 8) or binary (base 2). It also is involved when you take a string representing a number in a given base and convert it to the stored integer form. Normally, a stored integer is in binary, but that's typically invisible to the user, who normally enters or sees stored integers as decimal.
Write a function (or identify the built-in function) which is passed a non-negative integer to convert, and another integer representing the base. It should return a string containing the digits of the resulting number, without leading zeros except for the number 0 itself. For the digits beyond 9, one should use the lowercase English alphabet, where the digit a = 9+1, b = a+1, etc. For example: the decimal number 26 expressed in base 16 would be 1a. Write a second function which is passed a string and an integer base, and it returns an integer representing that string interpreted in that base. The programs may be limited by the word size or other such constraint of a given language. There is no need to do error checking for negatives, bases less than 2, or inappropriate digits.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Non-decimal radices/Convert step by step in the HicEst programming language
Source code in the hicest programming language
CHARACTER txt*80
num = 36^7 -1 ! 7836416410
CALL DecToBase(num, txt, 36)
WRITE(ClipBoard, Name) num, txt, BaseToDec(36, txt)
END
FUNCTION BaseToDec(base, string)
CHARACTER string
BaseToDec = 0
length = LEN_TRIM(string)
DO i = 1, length
n = INDEX("0123456789abcdefghijklmnopqrstuvwxyz", string(i)) - 1
BaseToDec = BaseToDec + n * base^(length-i)
ENDDO
END
SUBROUTINE DectoBase(decimal, string, base)
CHARACTER string
string = '0'
temp = decimal
length = CEILING( LOG(decimal+1, base) )
DO i = length, 1, -1
n = MOD( temp, base )
string(i) = "0123456789abcdefghijklmnopqrstuvwxyz"(n+1)
temp = INT(temp / base)
ENDDO
END
num=7836416410; txt=zzzzzzz; 7836416410;
You may also check:How to resolve the algorithm Read a file character by character/UTF8 step by step in the Haskell programming language
You may also check:How to resolve the algorithm Empty program step by step in the Io programming language
You may also check:How to resolve the algorithm Factorial step by step in the Iterative programming language
You may also check:How to resolve the algorithm Roots of unity step by step in the Ruby programming language
You may also check:How to resolve the algorithm Averages/Pythagorean means step by step in the Phix programming language