1 4 About the Course 17 min

Рет қаралды 50,097

7 жыл бұрын

Пікірлер: 14

@adnanmohamed6517 4 жыл бұрын

" 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 !

@evilniks0 4 жыл бұрын

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.

@eperez112178 6 жыл бұрын

Hey professor, thank you for sharing your knowledge! I look forward to completing this course. Thank you.

@temperedsand093 4 жыл бұрын

Thanks for sharing! Really helpful to me.

@asimo15 7 жыл бұрын

... thanks for this wonderful opportunity

@meta-cortex 6 жыл бұрын

thanks for sharing! but where is the forum?

@Crislips 5 жыл бұрын

How can I access the practice problems?

@dosanzpillay 5 жыл бұрын

Thanks prof. Tim Can you suggest me a book I am a begginer? And this lectures on KZfaq got me more interested in algorithms

@ericfricke4512 4 жыл бұрын

He wrote some books

@TimRoughgarden 5 жыл бұрын

Accompanying textbook: www.amazon.com/dp/0999282905

@amanakash893 3 жыл бұрын

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.

@cameronball3998 3 жыл бұрын

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.