The following algorithm represents the ____.
Function Numeric unKnown(Numeric x, Numeric y)
If y = 0 Then
Return x
Else
Return GCD(y, x % y)
End If
End Function
A) sum of squares
B) Fibonacci series
C) GCD function
D) factorial series

Question

Quizplus · Accepted Answer

The algorithm provided is a recursive implementation of the Euclidean algorithm for finding the greatest common divisor (GCD) of two numbers. It repeatedly applies the operation of replacing the larger number by its remainder when divided by the smaller one until the remainder is 0.

The Following Algorithm Represents the ____