Answer:
C++.
Explanation:
#include <iostream>
using namespace std;
//////////////////////////////////////////////////////////////
void countDown(int N) {
if ((N > -1) && (N <= 100)) {
if (N == 0) {
cout<<"I've learned how to use recursion!";
}
else {
cout<<N<<endl;
countDown(N-1);
}
}
else
cout<<"Invalid Range."<<endl;
}
//////////////////////////////////////////////////////////////
int main() {
int N;
////////////////////////////////
cout<<"Enter number: ";
cin>>N;
countDown(N);
////////////////////////////////
return 0;
}
////////////////////////////////////////////////////////////////////////////////////////////
Any Recursive function has two main things.
First is the break condition or base case, without it, the function would never stop calling itself and go into infinite loop.
In the above example, the base case was "N == 0".
Second, and the more difficult thing, is to write a proper recurring statement. This part is basically what recursion is all about, i.e. solve problems by breaking them down into smaller problems and then combining the result.
In the above example, this was "countDown(N-1)".
