Question

write a recursive function that returns true if the digits of a positive integer are in increasing order ; otherwise, the function returns false. Also write a program to test your function.

Answer 1

#include <iostream>

using namespace std;
bool isAscending(int n){
if(n == 0) return true;
if(n%10>(n/10)%10) return isAscending(n/10);
else return false;
}

int main()
{
int n;
cout << "Enter the number:" << endl;
cin >> n;
if(isAscending(n)) {
cout<<"Given number "<<n<<" is in increasing order"<<endl;
} else {
cout<<"Given number "<<n<<" is not in increasing order"<<endl;
}
return 0;
}

Output:

$g++ -o main *.cpp
$main
Enter the number:
Given number 1234 is in increasing order