How to resolve the algorithm Non-decimal radices/Convert step by step in the Common Lisp programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Non-decimal radices/Convert step by step in the Common Lisp 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 Common Lisp programming language

Source code in the common programming language

(parse-integer "1a" :radix 16) ; returns multiple values: 26, 2
(write-to-string 26 :base 16) ; also "1A"


(defun decimal-to-base-n (number &key (base 16))
  (format nil (format nil "~~~dr" base) number))

(defun base-n-to-decimal (number &key (base 16))
  (read-from-string (format nil "#~dr~d" base number)))


(defun change-base (number input-base output-base)
  (format nil "~vr" output-base (parse-integer number :radix input-base)))


  

You may also check:How to resolve the algorithm Sudoku step by step in the C programming language
You may also check:How to resolve the algorithm Identity matrix step by step in the Lambdatalk programming language
You may also check:How to resolve the algorithm Arithmetic/Integer step by step in the ABAP programming language
You may also check:How to resolve the algorithm Four is magic step by step in the Rust programming language
You may also check:How to resolve the algorithm Remove duplicate elements step by step in the Visual FoxPro programming language