Algorithm

To print numbers from 1 to n using forward recursion, the approach involves defining a recursive function that takes the current number as a parameter. The function first checks if the current number exceeds n; if it does, the recursion terminates. Otherwise, it prints the current number and then recursively calls itself with the next number incremented by one. This way, the numbers are printed in ascending order as the recursion unfolds forward from the base case to the maximum number. The key is to make the print statement before the recursive call, ensuring the numbers appear from 1 up to n in order.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Recursive function to print numbers from current to n
    void printNumbers(int current, int n) {
        // Base case: if current exceeds n, stop recursion
        if (current > n)
            return;

        // Print current number
        cout << current << " ";

        // Recursive call with next number
        printNumbers(current + 1, n);
    }
};

int main() {
    Solution sol;
    int n = 10;

    sol.printNumbers(1, n);
    cout << "\n";

    return 0;
}