Pages

Friday, May 23, 2025

Sum of N natural numbers using Recursion in C++

 #include <iostream>

using namespace std;


// sum of N natural numbers

int sum(int n) {
    if(n==1) {
        return 1;
    }

    return n+sum(n-1);
}

int main() {
   
    cout << sum(5) << endl;
    return 0;
}

No comments:

Post a Comment

3917. Count Indices With Opposite Parity (Brute Force) O(n2) + Optimized Solution O(n) + tips LEETCODE WEEKLY 500

  class Solution {     public int [] countOppositeParity ( int [] nums ) {          // approach 1 - checks every pair         int n = n...