Question

1. We can determine how many digits a positive integer has by repeatedly dividing by 10 (without keeping the remainder) until the number is less than 10, consisting of only 1 digit. We add 1 to this value for each time we divided by 10. a) Describe the algorithm in a recursive way b) Implement this recursive algorithm in C++ and test it using a main function that calls this with the values of 15, 105 and 15105. (Hint: Remember if n is an integer, n/10 will be an integer without the fractional part.)

Answer 1

#include<iostream>
#include<string>

using namespace std;

int count_digit(int num){
   if(num == 0){
      return 0;
   }
   else{
      return 1 + count_digit(num/10);
   }
}

int main() {
   cout<<"count_digit(15) = "<<count_digit(15)<<endl;
   cout<<"count_digit(105) = "<<count_digit(105)<<endl;
   cout<<"count_digit(15105) = "<<count_digit(15105)<<endl;
   system("pause");
   return 0;
}

$\color{blue}Please\; up\;vote\;the \;solution \;if \;it \;helped.\;Thanks!$