Question

The Euclidean algorithm - The Euclidean algorithm provides a wonderful way to calculate the greatest common factor of 2 numbers. The greatest common factor, which is the largest number that divides evenly into 1 or more numbers, is useful for reducing fractions. The Euclidean algorithm works by dividing 1 number by the other and finding the remainder. The 2 numbers are redefined, and then the process is repeated. The process ends when the remainder is equal to 0. Following is the pseudo code for the algorithm. In c++ Use 145 and 87 to test your program. The program will find the largest common factor of the numbers (the answer should be 29).
​

Answer 1

The pseudo-code of the algorithm will be:

Start

Set n1 equal to 145 and n2 equal to 87.

Divide n1 by n2 and find the remainder.

Set n1 equal to n2 and n2 equal to the remainder.

Repeat steps 2 and 3 until the remainder is equal to 0.

The greatest common factor is n1.

End

What do you mean by pseudocode?

In computer science, pseudocode is indeed a plain language description of a steps in an algorithm or similar system. Pseudocode frequently employs structural patterns of a conventional programming language, although it is designed for human interpretation rather than machine reading. It generally omits features necessary for computation of the algorithm, including such variable declarations and language-specific code. When possible, the programming language is supplemented by natural language description details or succinct mathematical notation.

To learn more about pseudocode

brainly.com/question/24735155

#SPJ9