･
Reviews 6
･
Average rating 4.3
The lecture is the best.. Especially when explaining the concept of combinational algorithms, the relationship between for loops and recursive functions was very good. When solving combinational problems with recursion, I simply added 1 to the index and set the level to set the termination condition, and I solved it. However, since I solved it without fully understanding it, I made mistakes in the implementation, and I thought that recursion itself was too difficult and I didn't want to solve the problem. However, after listening to this lecture, I think I accurately grasped and understood the concept itself. It was a very satisfying lecture to the point that I thought it would have been better if I had taken this lecture sooner. Thank you so much.
Hello, Mr. Kim Gyu-hyeok! Thank you so much for your sincere review. It may be difficult to understand the relationship between for loops and recursive functions in combination algorithms at first, so I'm glad that it helped you. ㅎㅎ Recursive functions are a difficult concept to approach at first, but once you understand them correctly, they are powerful tools that can be applied to various problems. I hope you continue to study hard, and if you have any questions or concerns, please feel free to contact me. Thank you :)
