**Count number of digits using recursion**

**Count number of digits using recursion**

Write a C program to Count number of digits using recursion. Here’s simple program to Count number of digits using recursion in C Programming Language.

**Recursion : :**

**Recursion : :**

- Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a
of the function.**recursive call**

- The C programming language supports recursion, i.e., a function to call itself. But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.

- Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.

**Problem : :**

**Problem : :**

Here is the source code of the C program to Count number of digits using recursion. The C Program is successfully compiled and run on a Windows system. The program output is also shown below.

**SOURCE CODE : :**

**SOURCE CODE : :**

/* C program to Count number of digits using recursion */ #include <stdio.h> int countDigits(int num) { static int count=0; if(num>0) { count++; countDigits(num/10); } else { return count; } } int main() { int number; int count=0; printf("Enter any number :: "); scanf("%d",&number); count=countDigits(number); printf("\nTotal number of digits in [ %d ] are :: %d\n",number,count); return 0; }

**Output : :**

**Output : :**

/* C program to Count number of digits using recursion */ Enter any number :: 12345678 Total number of digits in [ 12345678 ] are :: 8 Process returned 0

Above is the source code for C Program to Count number of digits using Recursion which is successfully compiled and run on Windows System.The Output of the program is shown above .

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may * Contact Us* through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.

**Thanks for reading the post….**