Question

2. Algorithm below shows the Greatest Common Divisor (GCD) algorithm to compute GCD, gcd, by given two integer values, p and q. Based on your understanding of the algorithm, draw the equivalent flowchart. GCD computation algorithm: While \((p \neq q)\) If \(p < q\) then \(q = q - p\ else if \(p > q\) then \(p = p - q\ end if end while gcd = p [10 marks]

          2. Algorithm below shows the Greatest Common Divisor (GCD) algorithm to compute GCD, gcd, by
given two integer values, p and q. Based on your understanding of the algorithm, draw the
equivalent flowchart.
GCD computation algorithm:
While \((p \neq q)\)
If \(p < q\) then
\(q = q - p\
else if \(p > q\) then
\(p = p - q\
end if
end while
gcd = p
[10 marks]

2. Algorithm below shows the Greatest Common Divisor (GCD) algorithm to compute GCD, gcd, by
given two integer values, p and q. Based on your understanding of the algorithm, draw the
equivalent flowchart.
GCD computation algorithm:
While (p ≠ q)
If p < q then
q = q - pelse if p > q then
p = p - qend if
end while
gcd = p
[10 marks]

Added by Alexander M.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Rabeya Zahid

Step 1

Start Show more…

Show all steps

Thanks for your feedback!

Algorithm below shows the Greatest Common Divisor (GCD) algorithm to compute GCD, gcd, by given two integer values, p and q. Based on your understanding of the algorithm , draw the equivalent flowchart. GCD computation algorithm: While (p # q) If p 4q then q=q - p else if p > q then p =p-q end if end while gcd = p [10 marks]