How to resolve the algorithm Infinity step by step in the PL/I programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Infinity step by step in the PL/I programming language

Table of Contents

Problem Statement

Write a function which tests if infinity is supported for floating point numbers (this step should be omitted for languages where the language specification already demands the existence of infinity, e.g. by demanding IEEE numbers), and if so, returns positive infinity.   Otherwise, return the largest possible positive floating point number. For languages with several floating point types, use the type of the literal constant   1.5   as floating point type.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Infinity step by step in the PL/I programming language

Source code in the pl/i programming language

declare x float, y float (15), z float (18);

put skip list (huge(x), huge(y), huge(z));

  

You may also check:How to resolve the algorithm Determine if a string is collapsible step by step in the 11l programming language
You may also check:How to resolve the algorithm Integer sequence step by step in the Clean programming language
You may also check:How to resolve the algorithm Sort an integer array step by step in the Raven programming language
You may also check:How to resolve the algorithm Draw a sphere step by step in the ATS programming language
You may also check:How to resolve the algorithm Exponentiation order step by step in the Swift programming language