Question

please solve this its urgent ​

Answer 1

Flow chart of an algorithm (Euclids algorithm) for calculating the greatesti Common divisor (g.c.d.) of two numbers a and inlocations named A and B. The algorithm proceeds6y successive subtractions in two loops: IF the test B >≈ A yields yes or true (more accurately, the number B in location B is greater than or equal to the number a in location A) THEN, the algorithm specihies B←B - A (meaning the number b - a replaces the old b) . Similarly, IF A>B. THEN A← A - B. The p rocess termninates when (the contents of) B is 0. yielding the g.c.d. in A. (Algorithn derived trom Scott 2009:13 symbols and drawin stye from tauswortne 1977)