Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,895 questions

51,826 answers

573 users

How to write a recursive function that counts digits of a number in C

1 Answer

0 votes
#include <stdio.h>
#include <stdlib.h>

int countDigits(long num) {
    // Base case: If the number is reduced to 0, return 0
    if (num == 0) {
        return 0;
    }
    // Recursive case: Divide the number by 10 and add 1
    return 1 + countDigits(num / 10);
}

int main() {
    long number = 19938420;

    // Handle the case for 0 explicitly
    if (number == 0) {
        printf("The number of digits is: 1\n");
    } else {
        // Use the recursive function with the absolute value of the number
        printf("The number of digits is: %d\n", countDigits(abs(number)));
    }

    return 0;
}



/*
run:

The number of digits is: 8

*/

 



answered Apr 6, 2025 by avibootz
...