Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 5 - Algorithms - Section 5.2 - Algorithm Representation - Questions & Exercises - Page 228: 3


The Euclidean algorithm.

Work Step by Step

The Euclidean algorithm finds the greatest common divisor of two positive integers X and Y by the following process: $X ←$ the larger input; $Y ← $the smaller input; while (Y not zero) do (Remainder ← remainder after dividing X by Y; $X ← Y$; $Y ← Remainder$); $GCD ← X$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.