How to resolve the algorithm Non-decimal radices/Convert step by step in the Erlang programming language
How to resolve the algorithm Non-decimal radices/Convert step by step in the Erlang 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 Erlang programming language
Source code in the erlang programming language
You may also check:How to resolve the algorithm Brownian tree step by step in the C# programming language
You may also check:How to resolve the algorithm Classes step by step in the Falcon programming language
You may also check:How to resolve the algorithm Associative array/Creation step by step in the Tcl programming language
You may also check:How to resolve the algorithm Parsing/RPN calculator algorithm step by step in the Groovy programming language
You may also check:How to resolve the algorithm Cholesky decomposition step by step in the MATLAB / Octave programming language