procedure gcd(a,b: positive integer x := a y := b while y # 0 begin r := x mod y x := y y :=r end {gcd(a,b) is x when y = r = 0} (Try example acd(9. 6))

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter10: Application Development
Section: Chapter Questions
Problem 6VE
icon
Related questions
Question

Try to compute gcd or lcm ( gcd(9, 6) or lcm(9,6) ) by the following algorithm.

procedure gcd(a,b: positive integers)
x := a
y := b
while y # 0
begin
r := x mod y
x := y
y :=r
end { gcd(a,b) is x when y = r = 0}
(Try example gcd(9, 6))
Transcribed Image Text:procedure gcd(a,b: positive integers) x := a y := b while y # 0 begin r := x mod y x := y y :=r end { gcd(a,b) is x when y = r = 0} (Try example gcd(9, 6))
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Returning value from Function
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning