// Time Complexity : O(n), Space Complexity : O(n) (Recursive) import java.io.*; import java.util.*; class GFG { static void printToN(int n) { if(n == 0) return; printToN(n - 1); System.out.print(n+" "); } public static void main(String [] args) { int n = 4; printToN(n); } }