ALGORITHMS AND PROGRAMMING IN PSEUDOCODE: The Art of Computer Programming by Elias Paul

Author:Elias Paul [Paul, Elias]
Language: eng
Format: azw3
Published: 2020-06-15T16:00:00+00:00

4. REPETITION STRUCTURES

So far, everything seen allows us to build pseudocodes that are executed just once, that is, instructions are executed one by one ne sequential until the execution of the End instruction is reached , however There are problems that require repeating sets of instructions, for example.

For example, programs that are constantly requiring the entry of a certain amount of data.

Suppose a company has 30 employees and you want to calculate the increase to the salary of each of them, a program must be built in which can enter the salary of each of the employees. With instructions hitherto known a very extensive program would be produced, the solution is employ repetition structures.

Repeating structures and selection structures belong to the branching instructions and even though both use a condition to determine undermine the action to be executed, the repetition structures differ from those of selection because they allow certain instructions to execute more than one time until condition is satisfied. Repeating structures also they are known as cycles or loops.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.