Sum of first n natural numbers using recursion.

PHOTO

Tue Feb 11 2025 05:26:37 GMT+0000 (Coordinated Universal Time)

Saved by @Rohan@99

#include <iostream>
using namespace std;

int SumOfNNaturalNumbers(int n)
{
  if(n == 1)
    return 1;
    
  return (n + SumOfNNaturalNumbers(n-1));
}

int main() 
{
  int n;
  cin >> n;
  
  cout << "Sum of first " << n << " natural numbers: " << SumOfNNaturalNumbers(n) << endl;
  return 0;
}

Save snippets that work from anywhere online with our extensions

Available in the Chrome Web Store

Get Firefox Add-on

Get VS Code extension

Comments

More like this

Outscal DS Advanced 1

@Rohan@99

Print Fibonacci series for first 100 terms. Fibonacci series with recursion. Factorial using recurssion. Sort stack using recursion. Print a pattern for given integer. First reduce 5 one by one until we reach a negative or 0. After we reach 0 or negative, we add 5 until we reach n. Input : 16 Output : 16 11 6 1 -4 1 6 11 16 || Input : 20 Output : 20 15 10 5 0 5 10 15 20 Print sum of digits of a number using recursion. Print nth Fibonacci number using recursion and memoization. Sum of first n natural numbers using recursion. Number of ways to reach nth stair using recursion. Given an array nums of distinct integers. Return all the possible permutations. You can return the answer in any order.

Memoization

@Rohan@99

Print nth Fibonacci number using recursion and memoization. Sum of first n natural numbers using recursion. Number of ways to reach nth stair using recursion. Given an array nums of distinct integers. Return all the possible permutations. You can return the answer in any order.

Browse more snippets >>