" I am totally uninterested in merely telling you facts or regurgitating code that you can already find on the web or in any number of good programming books. My goal here in this class, and the way I think I can best supplement the resources that you probably already have access to is to explain why things are the way they are." - Tim Roughgarden I wish all teachers have this mindset !
Hello Sir, I know basics of JAVA but I never understood the execution of recursion properly. So what should I do ? Can someone please explain the execution of a recursive function... Specifically the last line where "return" statement is defined.
Essentially, you solve a problem by solving subsets of that problem. Take a binary tree for example. By definition, every binary search tree has a left and right sub-tree. After thinking a little bit, you might realise that every sub-tree can be thought of as its own binary tree. So a recursive algorithm for doing anything on a binary tree could apply to a base case of just a binary tree with two "leaf nodes" (sub-trees with no child nodes). That idea of a base case is critical, as it provides a "stopping point" for the algorithm. Else, the algorithm would try to keep calling itself forever.
![Chance The Rapper, DJ Premier - Together (2024) | [Official Music Video]](http://i.ytimg.com/vi/ZVwTX6WP-MM/mqdefault.jpg)
" I am totally uninterested in merely telling you facts or regurgitating code that you can already find on the web
or in any number of good programming books. My goal here in this class, and the way I think I can best supplement the resources that you probably already have access to is to explain why things are the way they are."
- Tim Roughgarden
I wish all teachers have this mindset !
thanks for this course.. Now I will not feel excluded at that computer science cocktail party, when someone cracks a joke on Dijkstra's algorithm.
Hey professor, thank you for sharing your knowledge! I look forward to completing this course. Thank you.
Thanks for sharing! Really helpful to me.
... thanks for this wonderful opportunity
thanks for sharing! but where is the forum?
How can I access the practice problems?
Thanks prof. Tim Can you suggest me a book I am a begginer? And this lectures on RUclips got me more interested in algorithms
He wrote some books
Accompanying textbook: www.amazon.com/dp/0999282905
Hello Sir, I know basics of JAVA but I never understood the execution of recursion properly. So what should I do ? Can someone please explain the execution of a recursive function... Specifically the last line where "return" statement is defined.
Essentially, you solve a problem by solving subsets of that problem. Take a binary tree for example. By definition, every binary search tree has a left and right sub-tree. After thinking a little bit, you might realise that every sub-tree can be thought of as its own binary tree. So a recursive algorithm for doing anything on a binary tree could apply to a base case of just a binary tree with two "leaf nodes" (sub-trees with no child nodes). That idea of a base case is critical, as it provides a "stopping point" for the algorithm. Else, the algorithm would try to keep calling itself forever.
I feel excited for the course, but I also feel intimidated by the sexiness of your voice... anyone else?