Skip to content

luc050.c

Problem Statement

Write a recursive function to obtain the sum of first 25 natural numbers.

Metadata

Property Detail
Author Amit Dutta amitdutta4255@gmail.com
Date 08 Feb 2026
License MIT License (See the LICENSE file for details)
Difficulty Beginner (index: 1 / 10)

Concepts

Beta Feature

This concept detection system is still in beta and may occasionally show incorrect or incomplete results.

  • Recursion

Actions

Raw View on GitHub

You can print or save this file by opening Raw and using your browser.

Source Code

#include <stdio.h>
#include <math.h>
#include <stdlib.h>

int get_sum(int);

int main()
{
    int n = 25, sum;

    sum = get_sum(n);
    printf("Sum of first %d natural numbers is: %d\n", n, sum);

    return 0;
}

int get_sum(int n)
{
    if (n == 0)
        return 0;
    else
        return n + get_sum(n - 1);
}

Explanation

Explain with AI

Copy the prompt below and paste it into any AI assistant.

    You are explaining a C programming code to a beginner.

    STRICT RULES:

    - Only use the given code. Do NOT assume anything not present.

    - Do NOT add extra examples.

    - Keep explanation clear and short.

    - If something is unclear, say "Not clear from code".

    - Follow the exact format below. Do NOT change headings.

    FORMAT:

    [START]

    ## What it does

    (Explain the overall purpose in 1-2 sentences)

    ## Step-by-step

    (Explain how the code works in steps, simple language)

    ## Key Concepts

    (List concepts like loop, condition, function, etc.)

    ## Notes

    (Mention any limitations, errors, or assumptions)

    [END]

    CODE (luc050.c):

    #include <stdio.h>
    #include <math.h>
    #include <stdlib.h>

    int get_sum(int);

    int main()
    {
        int n = 25, sum;

        sum = get_sum(n);
        printf("Sum of first %d natural numbers is: %d\n", n, sum);

        return 0;
    }

    int get_sum(int n)
    {
        if (n == 0)
            return 0;
        else
            return n + get_sum(n - 1);
    }