Rewrite the steps of Algorithm 4.8.2 for a computer language with a bu...

Rewrite the steps of Algorithm 4.8.2 for a computer language with a built-in floor function but without div and mod.

Reference:

[Given two integers A and B with A > B ≥ 0, this algorithm computes gcd(A, B). It is based on two facts:

1. gcd(a, b) = gcd(b, r ) if a, b, q, and r are integers with a = b ·q + r and 0 ≤ r < b.

2. gcd(a, 0) = a.]