How to resolve the algorithm Count in octal step by step in the Oberon-2 programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Count in octal step by step in the Oberon-2 programming language
Table of Contents
Problem Statement
Produce a sequential count in octal, starting at zero, and using an increment of a one for each consecutive number. Each number should appear on a single line, and the program should count until terminated, or until the maximum value of the numeric type in use is reached.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Count in octal step by step in the Oberon-2 programming language
Source code in the oberon-2 programming language
MODULE CountInOctal;
IMPORT
NPCT:Tools,
Out := NPCT:Console;
VAR
i: INTEGER;
BEGIN
FOR i := 0 TO MAX(INTEGER) DO;
Out.String(Tools.IntToOct(i));Out.Ln
END
END CountInOctal.
You may also check:How to resolve the algorithm Hello world/Graphical step by step in the VBScript programming language
You may also check:How to resolve the algorithm Sort stability step by step in the R programming language
You may also check:How to resolve the algorithm MD5 step by step in the Slate programming language
You may also check:How to resolve the algorithm Josephus problem step by step in the Vedit macro language programming language
You may also check:How to resolve the algorithm Simple windowed application step by step in the AutoHotkey programming language