Solving Tower Of Hanoi Problem With Recursion

Показать описание

Smash that 'Like' button and hit 'Subscribe' to stay ahead in the coding game. Let's go on this coding adventure together! 💫

Playlists curated for our students: 👇

Рекомендации по теме

Комментарии

It would have been nice if you could have shown a recursive tree as well.

allenalex

the sound quality of CN classes are Really Really Really awesome...(kind of appealing).

amangupta

great explanation, just a small tip since you have already made the hint video can you please add it in recursion assignment 1b q5 as well since the hint video is not present there

vaibhavmurarka

i appreciate your hardwork sir and also, learning from our courses i am from july batch 2022

sanchittripathi

Just a Joke:
Sir:Hanoi problem is super
after sometime :
ye kaise hogi sorry😂😂😂😂😂😂😂

tuntunewala

i was having problem in understanding this topic, so searched on youtube. thankfully i got the best explanation.

nsg

"if I have n-1 disks, I can assume that I can move the using a helper"... how does this assumption work?

Hoxolotl

But you can't move more than one disk at a

lsdxsaurabh

if u can move n-1 which is 3 disk at once then why u cant move 4 disk directly?

ajaywavare

Sir plz make video on placements happening from coding ninja course.
It will encourage more people to join and understand the placement scenario in coding ninja.

shubhamgupta

Thank you sir, understood the explanation perfectly

aakritiroshan

thnx for breaking down this problem it is super easy

void tower(int n, char source, char helper, char destination){
if(n==1){
cout<<source<<" "<<destination<<endl;
return;
}else if(n==0){
return;
}
tower(n-1, source, destination, helper);
cout<<source<<" "<<destination<<endl;
tower(n-1, helper, source, destination);
}

saumilaggarwal