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

Published on 12 May 2024 09:40 PM
#Objeck

How to resolve the algorithm Middle three digits step by step in the Objeck 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 Objeck programming language

Source code in the objeck programming language

class Test {
  function : Main(args : String[]) ~ Nil {
    text := "123, 12345, 1234567, 987654321, 10001, -10001, -123, -100, 100, -12345, 1, 2, -1, -10, 2002, -2002, 0";
    ins := text->Split(",");
    each(i : ins) {
      in := ins[i]->Trim();
      IO.Console->Print(in)->Print(": ");
      in := (in->Size() > 0 & in->Get(0) = '-') ? in->SubString(1, in->Size() - 1) : in;
      IO.Console->PrintLine((in->Size() < 2 | in->Size() % 2 = 0) ? "Error" : in->SubString((in->Size() - 3) / 2, 3));
    };
  }

}

You may also check:How to resolve the algorithm Fibonacci word/fractal step by step in the Scilab programming language
You may also check:How to resolve the algorithm Random numbers step by step in the MiniScript programming language
You may also check:How to resolve the algorithm Fairshare between two and more step by step in the Haskell programming language
You may also check:How to resolve the algorithm Arrays step by step in the ChucK programming language
You may also check:How to resolve the algorithm Spiral matrix step by step in the Icon and Unicon programming language