C++ Greatest Common Divisor (GCD) Algorithm: Recursive Implementation
The missing parameter in the recursive call to 'gcd' function should be 'x%y'.
The corrected code is:
#include<iostream>
using namespace std;
int gcd(int x,int y){
if(x%y==0) return y;
els