Complete C++ Placement DSA Course - Lecture 31: Learning Recursion the Best Way! | 10 Day Recursion Challenge

In this Video, we are going to learn a very important concept i.e. Recursion. There is a lot to learn, Keep in mind “ Mnn boot karega k chor yrr apne se nahi yoga ya maza nahi para, Just ask 1 question “ Why I started ? “ Visit Coding Ninjas: https://bit.ly/3cfdKTe CodeStudio Reference: https://www.codingninjas.com/codestudio/guided-paths/data-structures-algorithms/content/118522/offering/1380913 Discord Server Link: https://discord.gg/feSQvVXMrd Course Flow: https://whimsical.com/dsa-4-placement-by-love-babbar-C7JX2fJ8hprv9ivEHkArjD@2Ux7TurymNF9zkFahVLk Handwritten Notes: https://drive.google.com/file/d/13PbTXOexbcTghMSUtCAVuT2g-MjYQASV/view?usp=sharing Slides Link: https://drive.google.com/file/d/1xCwDQQvcSnS3sHQQ-cr2-nNuZbait51r/view?usp=sharing Code Links: https://github.com/loveBabbar/CodeHelp-DSA-Busted-Series Do provide you feedback in the comments, we are going to make it best collectively. Connect with me here: Instagram: https://www.instagram.com/lovebabbar1/ Twitter: https://twitter.com/lovebabbar3 Telegram Group Link: Love Babbar CODE HELP https://telegram.me/lovebabbercodehelp Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used. Timestamps: 00:00 - Introduction 00:48 - What ?? 03:03 - Example - Power of 2 04:15 - Promotion 05:19 - Example - Factorial 08:18 - Code - Factorial 11:50 - Why Base Case ? 19:00 - Function Call Stack flow - Factorial 22:48 - Recursion Tree - Factorial 25:00 - Components of Recursive Functions 26:55 - Code - Power of 2 29:20 - Example - Print Counting 30:30 - Code - Print Counting 32:35 - Function call Stack - Print Counting 35:00 - Recursion Tree - Print Counting 36:15 - Documentation Reference #DSABusted #LoveBabbar