・
Reviews 14
・
Average rating 5.0
Completed 100% of course
Certainly, seeing the logic or concept in action seems less boring and easier to understand than reading a book! I'll try the in-depth version too~!! The lecture is really good. ps) Hanoi Tower Tips 1) Think of the largest disk as an image of the remaining disks being contained in a large ball or pocket 2) Think of the Hanoi function name as Move I got a little lost in the Hanoi Tower lecture, so I'll leave this here.
gamja5
Instructor
Recursive functions are not an easy concept, but it seems amazing that you made it your own in one go! Thank you for leaving such great know-how. ㅎㅎ👍👍







