Question
2. Given an algorithm as: int GCD(int a, int b) { if( b == 0) return 1; else return GCD(b, a % b); } What
2. Given an algorithm as:
int GCD(int a, int b)
{
if( b == 0)
return 1;
else
return GCD(b, a % b);
}
What type of algorithm is this recursive or iterative? Explain your answer. Determine
GCD(56, 48) using the above algorithm.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Privacy In Statistical Databases Unesco Chair In Data Privacy International Conference Psd 2014 Ibiza Spain September 17 19 2014 Proceedings Lncs 8744
Authors: Josep Domingo-Ferrer
2014th Edition
3319112562, 978-3319112565
