DSA - Level 1 - Introduction to Recursion - How Recursion Works | Print Decreasing using Recursion

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that. NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. With this video, we introduce the concept of Recursion and how it is widely used in the world of programming and explain the working of Recursion. With this, we also move towards our first question of recursion where we are required to print all decreasing numbers from a given number. In this problem, 1. You are given a positive number n. 2. You are required to print the counting from n to 1. 3. You are required to not use any loops. To submit this question, click here: https://www.pepcoding.com/resources/online-java-foundation/introduction-to-recursion/print-decreasing-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education