Archived
The following recursive algorithm is used to calculate the Greatest Common Divisor of two numbers a and b (0<=b<=a and a=qb +r):
function calcPGCD(a, b)
{
If b = 0
{
display a;
}
Else
{
calcPGCD (b, a modulo b);
display ''calcPGCD('' +a+ '','' +b+'')'';
}
}
What does this code display when a is 21 and b is 15?
0
Community EvaluationsNo one has reviewed this question yet, be the first!
6
What type of structure are the results of a recursive function stored in?9
What is recursion?7
What is special about quick sort?2
Given an array of 17 elements sorted in ascending order, what is the cost of accessing the element with index 10?2
What about the merge sort method?5
What does the While loop do?2
What is the complexity of this algorithm?