Lecture 52: How To Solve Recursion Problem from 4 different Method

Recursion in c++ | What is Recursion | Recursion Basic
Home work sheet: drive.google.c...
Join Our Whatsapp Channel: whatsapp.com/c...
Day 73/180, #180daysofcode #180 hard
We have made a whole video in c++, How to solve pattern print problem. We explained everything with the help of code.
We are doing 180 days challenge and going to complete the whole course within the duration with quality content on UA-cam. I am on the mission to create a tech revolution in our country and in upcoming future we want to create a tech which will create many jobs in India.
Video will come on Mon-Fri at 6am in the morning
CoderArmy Website (Buy premium feature at 99 Only for 6 months): www.coderarmy.in
Premium Feature includes:
1: Doubt Support
2: Mentorship session
3: Placement Support to Top Students
4: Resume and Linkedin Profile Building
5: Coding contest twice a month
6: Course completion Certificate
7: Home work Discussion
DSA Course for free
C++ Free Course
Rohit Negi DSA Course C++
Coder Army DSA Course c++
Function in C++
Pointers in C++.
Strings
Vector
Introduction to Recursion
connect to me on Instagram: rohit978.page....
Linkedin: rohit978.page....
Telegram: rohit978.page....

[@CoderArmy9]

Kaisi chal rahi hai aapki preparation...

[@dancewithme2005]

Sab chamak Raha hai ❤

[@joydeep-halder]

Bahut Badhiya bhaiya

[@subhojit627]

Badiya bhaiya

[@averagecoder7]

Bilkul sahi chal Rahi hai 🔥

[@machinecode2.047]

Sir leetcode questions karo

[@MathsWithSatyamPandey]

Reverse approach my best part bhaiya ❤

[@anupammishra6514]

Recursive tree is the best part of the video and ......i liked reverse order approach ❤❤❤

[@HarshitSrivastav-yw4xy]

Even number from 1 to n:
#include
using namespace std;
void fun(int n)
{
if(n==2)
{
cout

[@akashkewat1219]

Mera best part toh jin wala tha, just imagining jin stucked in a loop of stairs.
Thanks bhaiya😊

[@pratapkumar7249]

bhiya aaj to maja hi hi a gaya aapne kahani bhi aaj suna diya jin wala😂

[@CoderArmy9]

Good Luck Bhai

[@5harshitshrivastava]

Samjh aa gya
Lec 52 completed

[@HarshitSrivastav-yw4xy]

H.W :Table
#include
using namespace std;
void fun(int n,int N)
{
if(n>10)
return;
cout

[@jerry-vv2jk]

bhaiya , first time i am learning recursion like this🔥

[@Rituk02]

that story was amazing..started liking coding because of u..Thank You!

[@rohitjaiswal5105]

Bhaiya aseha toh sab hi acha laga q ki kuch sikhnai ko mila aur sabse best sochne ke baad reverse order mai print karne wala technique acha tha❤ ❤❤

[@karankumar3983]

Bhaiya best part jab aapne odd num vaale case ko main mai sambhal liya nhi toh mai usse function mai sambhal Raha tha and muskil ho rha tha thoda ❤❤❤❤❤

[@ankushladani496]

There are 2 types of recursion
Head recursion
Tail recursion
Please explore this 2.

[@stoicsaga906]

Q3.-> Write a Table program using recursion. Take input number n, and print its table.
# include
using namespace std;
void table(int i,int n){
if(i==11){
return;
}
int mul=n*i;
cout

[@Harsh-sx4xv]

Great video : Table program->
#include
void table(int,int);
int main()
{
int n;
std::coutn;
table(n,1);
return 0;
}
void table(int n,int x){
if(x>10)
return;
std::cout

[@sagar00121]

Last ki recursion story me maza aa gya "Zin ke lag gaye"
or,,
Lacture or ki baat hi agal thi

[@Kamleshtravelgram]

carry on bhai all Dreams come dream true keep shining ❤

[@Ak250-o8k]

pura lecture hi best hai

[@DEEPJAIN_]

sir next level
course leke course ka nhi samaja but apka samaj gaya

[@abhinavparashar1934]

54:00
Here is the another way to solve this question
#include
using namespace std;
void Print(int num)
{
if (num == 1)
{
return;
}
Print(num - 1);
if (num % 2 == 0)
{
cout

[@Shreee_fact]

even problm 2 argument diff method:-
#include
using namespace std;
void print(int num, int n)
{
if (num == n)
{
if (num % 2 == 0)
{
cout

[@actualsatan2420]

Awesome recursion lecture.

[@SupremeAlpha-o1s]

#include
using namespace std;
void print_odd(int n)
{
if ( n == 1)//Base condition
{
cout

[@joydeep-halder]

HW Solution: from 10 to n.
void print(int n){
if(n

[@Himanshu_85-e2i]

bhaiya mai late se padh raha hu apka dsa course aur abhi recursion ke 2nd video pe aa gaya hu aur bahut maza ata hai bhaya padhne me pura samajh ata hai ( you are great bhaiya for us .) ( you are doing very hard work for us bro ) ( we shall be very thankful for your hard work bhaiya )

[@owais2609]

start kab kiya?

[@Himanshu_85-e2i]

@@owais2609 so mahina pehle kiye the but Ghar chal Gaye the na chhutti me to piche ho gayev

[@owais2609]

acha mane bhi abhi start kiya tha kuch 1 mahina phle ma bhi recursion pe hu 🙂🙂@@Himanshu_85-e2i

[@stoicsaga906]

Q2.🍵🍵-> Print all numbers from 10 to n using recursion, where n will be greater than 10
Ans->
# include
using namespace std;
void print(int n){
if(n==10){
cout

[@Swiftie03]

I'll definitely donate if i meet the Jin 😂

[@rhitam_biswas]

Recursion lecture 2 done ✅✅✅

[@simmi641]

Recursion best playlist
And last mein story was awesome😂😂

[@junaidalianwar23]

best part wo laga jahan par 1 hi argument pass krke hamne same problem ko solve kiya ( jo 2 args pass krke ho raha tha)

[@kausiksikdar2054]

Done Bhaiya
Jini be like: Ye coder army se recursion padke aya hain

[@Shreee_fact]

odd problem ans:-
#include
using namespace std;
void print(int num)
{
if (num == 1)
{
cout

[@adityatomar-se4yw]

Best recursion series

[@stoicsaga906]

# include
# include
# include
using namespace std;
void odd(int n){
if(n==1){
cout

[@skillfulmind960]

Completely Awesome explanation of different types of Recursion .

[@pratapkumar7249]

abhi ham roz aapki vidio dekhte hai

[@user-vk3vb6fn9e]

Recursive tree is the best part of the whole recursion

[@harimohansharma5561]

base case ko two ways se lena mera best part h kyuki usse me question ko do tarike se kar sakta hu.

[@universalmeditationmusic9299]

all concept clear and easy

[@jasmeetsingh3170]

sir recursion jinn wali story badi funny thi love you sir ji

[@rajaryan5884]

THANK YOU BHAIYA FOR MAKING THE CONCEPTS SO EASY

[@motivationlines9461]

Awesome lecture bhaiya crystal clear

[@sakshinadankar3782]

Last ki story ekdam mst thi😂
Thank u😊

[@Aryan-wl7mc]

When this will be all over this DSA course.. I am gonna miss it 😂😭

[@joydeep-halder]

HW Solution for printing all odd numbers.
void printOdd(int n){
if(n

[@FireGamerz-of6vv]

After watching the leacture
1) printing the element at the time of pushing the function in to the stack (5 to 1) => 5,4,3,2,1;
2) printing the element at the time of popping the function from the stack(1 to 5) => 1,2,3,4,5 [5 is enters1st it is completed last, 1 is enters last but it is completing 1st];

[@kapildas968]

reverse method sabse accha lagaa

[@joydeep-halder]

HW Solution: Table
void print(int i, int n){
if(i>10) return;
cout

[@vikramadityagurjar2005]

maza agya gurudev

[@AkashKumawat-g6y]

Maja aa gaya recursion me❤ and kahani achhi thi😂

[@DevanshGupta-io7rl]

recursion jaan bacha skta hai

[@SatendraChauhan-ke5yr]

1:2:30 arre bhaiya apko paisa kyo donate kare aap to pahle se hi aamir hai 😀😀😀😀😀

[@nanumix3167]

14:35

[@SiyaRamSiyaRam1008]

1:00:01 best part bhaiya 😂😂

[@MathsWithSatyamPandey]

Amazing❤ Series bhaiya

[@stoicsaga906]

what i solve i will post it from you bhaiya🙏🙏🙏🙏🙏🙏

[@Vivekkumarmishra01]

recurrsion samaj gaya finally

[@nownow1025]

recursion tree.🤩

[@omkadam2986]

Done 👍

[@user-es4xw9im7x]

Tnx for the video bhaiya❣

[@shubhamkumarjha9192]

1:01:30 Ginnn be like : Mujhe fasaya gaya hai 😂

[@debrajkundu2318]

Jin Wala Part sera tha 😂🤣😅

[@Sony_47]

best part of video is "story of jinn ! ";

[@dibbodas4116]

sir, you did not say why to use recursion instead of loop

[@VineetDixit]

awesome lecture

[@shivanshmishra4562]

bhaiya budh budh se gyan badha raha hai ,saandar explanation bhaiya

[@DarkDragon-bz6qp]

Done

[@user-jo8ow1mj8b]

nice explanation

[@Codes_king]

jai hind bhaiya, and love you to

[@dipakmali9817]

Done
Day 73/180 ✅

[@ankushladani496]

Thanks Bhaiya...❤🎉

[@ankushladani496]

Done Bhaiya... Day 73/180 ✅

[@daily-motivaion]

Sab chamak gaya bahiya

[@heetpatel3037]

Chamka bhaiya chamka

[@relaxingtime2411]

Bhaiya Jin ki story sandar thi 😂

[@YashSaini007]

Bhaiya Radhe Radhe 🙏

[@shubhamkumarjha9192]

Good morning bhaiya ji 💖

[@manishhans8469]

Jai hind jai bharat.😊

[@AakashParvani]

Day 73 👍✅ Chamak Gaya

[@user-ns2ud1xn4i]

sir ap to asa kh re ho rsgulla psnd h ya rasmlai
dono pkwan hi mjedar h to kese btaye kya psnd h kya nhi

[@user-tb6hk8tb9f]

awesome lecture

[@AbdullahRaza-hg1ff]

Good morning bhaiya ❤

[@GopalKumar-xu3iw]

day 73/180 done

[@dashstar33]

Masth tha easy

[@dancewithme2005]

Good morning 🌄

[@rohitkumarsingh6991]

gin aayega to mai use break condtion samjha dunga taaki fir wo ullu na bane🤣🤣🤣

[@SmritiSharma-vv7ib]

bhaia leet code questions krwaya kro khub saare please

[@SurajGupta-ux2se]

that Gin be like "Mujhe mere ghar jana hai "

[@nikhilrai6373]

chamak gaya

[@anupammishra6514]

Chamak gya bhaiya

[@SupremeAlpha-o1s]

#include
using namespace std;
void print(int a, int b)
{
if(a == b)
{
cout

[@crazy_kunta_cs]

day2

[@itshirdeshk]

Day 73 ✅🔥

[@Lisa_itz]

Dsa ❤🔥

[@deep_singh01]

Day 73/180 👍

[@Swiftie03]

👏👏

[@kartikeydwivedi6892]

best part 1:02:35 😂😂

[@IR20025]

IR07117D

[@user-bt6iv3rj7h]

comeback

[@premsingh6967]