C Programs on Recursion

Recursion is the process of a function calling itself directly or indirectly, and the associated function is called a recursive function. Recursive functions and algorithms are useful for solving many math problems, tree problems, tower of Hanoi, graph problems, and more. The following section contains various programs on mathematical operations with recursion, strings with recursion, linked lists, and tree algorithms with and without recursion.

Each sample program on the recursion includes a program description, C code, and program output. All examples have been compiled and tested on Windows and Linux systems.

Here is the listing of C programming examples on Recursion & No Recursion:

1. C Programs on Mathematical Operations using Recursion
2. C Programs on Linked List using Recursion
3. C Programs on Linked List without using Recursion
4. C Programs on Tree using Recursion
5. C Programs on Tree without using Recursion
6. C Programs on Strings using Recursion
7. C Programs on Data Structures using Recursion

/*  
 * C program to find the reverse of a number using recursion
 */
#include <stdio.h>
#include <math.h>
 
int rev(int, int);
 
int main()
{
    int num, result;
    int length = 0, temp;
 
    printf("Enter an integer number to reverse: ");
    scanf("%d", &num);
    temp = num;
    while (temp != 0)
    {
        length++;
        temp = temp / 10;
    }
    result = rev(num, length);
    printf("The reverse of %d is %d.\n", num, result);
    return 0;
}
 
int rev(int num, int len)
{
    if (len == 1)
    {
        return num;
    }
    else
    {
        return (((num % 10) * pow(10, len - 1)) + rev(num / 10, --len));
    }
}