Question

Give the output of the following C++ program and explain your reasoning:

#include <iostream>

using namespace std;

int gcd( int , int ); //Function prototype

int main() {

int a = 105;

int b = 30;

cout << “The GCD of “ << a << “ and “ << b << “ is “ << gcd(a,b) << endl;

return 0; }

int gcd(int a, int b) {

if ( b == 0 )

return a;

else

return gcd(b,a%b);

}

Answer 1

EXPLANATION -

FIRSTLY THE CODE IS USING FUNCTION DEFINATION AND EXPLANATION AT TWO DIFFERENT PLACES.

INT GCD(INT,INT) - GCD IS A NAME OF FUNCTIN AND IT TAKES TWO ARGUMENT THAT ARE ALSO INTEGERS . IT RETURNS AN ITEGER AS THE OUTPUT.

EXPLANATION OF GCD FUNCTION-

IT IS A RECURSIVE FUNCTION AND INITIALLY IT WILL TAKE 105 AND 30 AS ARGUMENT

IF B == 0 THEN THE GREATEST DIVISOR IS THE NUMBER ITSELF AS BECAUSE 0 IS DIVISIBLE BY EVERYTHING

NOW WHAT IS HAPPENING IS IT WILL REVERSE THE PARAMETER AND CALL THE FUNCTION

GCD(30,15) AS 105%30 = 15 BY DOING THIS THEY WILL GET TO KNOW THAT WHAT IS THE GREATEST NUMBER THAT DIVIDES BOTH

NOW AGAIN 15!=0 SO CALL FUNCTION GCD(15,0) AS 30%15==0

NOW AS B =0 THE OUTPUT IS 15

OUTPUT AND CODE-

OUTPUT IS 15

PROOF-

CODE

1 #include <iostream> 2 3 using namespace std; 4 5 int ged( int int ); //Function prototype 6 7 - int main() { 8 Rectangular Snip 9 int a = 105; 10 11 int b 30; 12 13 cout << "the GCD of " « a «< " and << b << 14 15 return 0; } 16 17. int gcd(int a, int b) { 18 19 if ( b © ) 20 21 return a; is << ged(a,b) << endl; 22 23 else 24 25 return gcd(b, a%b); 26 27 }

OUTPUT

the GCD of 105 and 30 is 15 ...Program finished with exit code 0 Press ENTER to exit console.

FEEL FREE TO ASK ANY DOUBT IN COMMENT SECTION.