How to resolve the algorithm Middle three digits step by step in the Quackery programming language

Published on 12 May 2024 09:40 PM
#Quackery

How to resolve the algorithm Middle three digits step by step in the Quackery programming language

Table of Contents

Problem Statement

Write a function/procedure/subroutine that is called with an integer value and returns the middle three digits of the integer if possible or a clear indication of an error if this is not possible. Note: The order of the middle digits should be preserved. Your function should be tested with the following values; the first line should return valid answers, those of the second line should return clear indications of an error: Show your output on this page.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Middle three digits step by step in the Quackery programming language

Source code in the quackery programming language

  [ 1 & not ]                       is even    (   n --> b )

  [ over size - 
    space swap of
    swap join ]                     is justify ( $ n --> $ )

  [ abs number$
    dup size dup 3 < iff
      [ 2drop $ "too few digits" ]
      done
    dup even iff
      [ 2drop $ "even digit count" ]
      done
    dup 3 = iff
      drop done
    3 - 2 /
    tuck split nip
    swap negate split drop ]        is middle3 (   n --> $ )

   ' [ 123 12345 1234567 
       987654321 10001 -10001 
       -123 -100 100 -12345 1 
       2 -1 -10 2002 -2002 0 ]

   witheach
     [ dup number$ 9 justify echo$ 
       say " --> "
       middle3 echo$ cr ]

You may also check:How to resolve the algorithm Harshad or Niven series step by step in the PILOT programming language
You may also check:How to resolve the algorithm Loops/Foreach step by step in the Common Lisp programming language
You may also check:How to resolve the algorithm Roots of a quadratic function step by step in the Mathematica/Wolfram Language programming language
You may also check:How to resolve the algorithm Boolean values step by step in the ALGOL W programming language
You may also check:How to resolve the algorithm Shell one-liner step by step in the Python programming language