Sum 1 to n Recursion

 #include <stdio.h> // Standard Input/Output library for printf and scanf


// Function Prototype (Declaration) - Good practice in C

void sum(int n, int s);


// Recursive function to calculate the sum of numbers from 1 to n

// n: the current number to add

// s: the running sum (accumulator)

void sum(int n, int s) {

    // Base Case (Stopping Condition): When n becomes 0, the recursion stops.

    if (n == 0) {

        // Print the final accumulated sum (s)

        printf("%d\n", s);

        return;

    }

    

    // Recursive Step: Call the function again with

    // 1. n decreased by 1 (moving to the next number)

    // 2. s increased by the current value of n (adding n to the running sum)

    sum(n - 1, s + n);

    

    // The 'return;' after the recursive call is optional here since the function returns void.

    // It's kept for consistency with the original C++ code structure.

    return;

}


int main() {

    int n;

    

    // Read the integer n from the user

    // The format specifier %d is used for an integer, and &n gives its memory address

    scanf("%d", &n); 

    

    // Start the recursive process. 

    // The initial call is sum(n, 0), where n is the limit and 0 is the starting sum.

    sum(n, 0);


    return 0; // Return 0 to indicate successful execution

}

Comments

Post a Comment

Popular posts from this blog

Transpose

  #include <stdio.h> int main () {     int m , n ;     printf ( "Enter the number of rows and columns of the matrix: " );     scanf ( " %d %d " , & m , & n );     int matrix [ m ][ n ]; // Original matrix     int transpose [ n ][ m ]; // Transposed matrix     printf ( "Enter the elements of the matrix: \n " );     for ( int i = 0 ; i < m ; i ++ ){         for ( int j = 0 ; j < n ; j ++ ){             printf ( "Enter element [ %d ][ %d ]: " , i , j );             scanf ( " %d " , & matrix [ i ][ j ]);         }     }     // Print the original matrix     printf ( " \n Original Matrix: \n " );     for ( int i = 0 ; i < m ; i ++ ) {         for ( int j = 0 ; j < n ; j ++ ) {         ...
Read more

1 to n without any parameter Recursion

  #include <iostream> using namespace std ; void print ( int n ){     if ( n == 0 ) return ;     print ( n - 1 );     cout << n << endl ; } int main (){     int n ;     cin >> n ;     print ( n ); } //EXPLANATION /* before printing n bar bar call laga rha h same funnction ko 4 se minus hote hote 1 tak gya uske bad jb n 0 hua to return hua aur uske bad jita sara fucntion ko call kiya wo sb phirse run honge kyunki wo sb run pura nhi hua tb jake wo piche se suru hoga print krna phir jb n 1 that wo fnc khtm hoga uske bad jb n 2 tb wo hoga khtm krte krte puche se fnc khtm hoga */
Read more

Recursion Factorial

  #include <stdio.h> int factorial ( int n ) {     if ( n == 0 || n == 1 ){         return 1 ;     } else {         return n * factorial ( n - 1 );     } } int main () {     int n ;     printf ( "Enter no.: " );     scanf ( " %d " , & n );     printf ( " %d " , factorial ( n ));     return 0 ; }
Read more