Shu Shu’s foundation is weak, many things in the homework are incomprehensible, the assigned experiments are also a headache, feels this course is quite difficult, wants to find a classmate to discuss × (ask for advice √) problems, can treat them to milk tea and a meal 
https://mitpress.mit.edu/9780262046305/introduction-to-algorithms/
Very thick, but not many chapters need to be read. I don’t know how the fourth edition is arranged, but in the third edition it is:
- 3 Growth of Functions
- 4 Divide-and-Conquer
- 15 Dynamic Programming
- 16 Greedy Algorithms
- 34 NP-Completeness
2 Likes
Okay, thank you.
Hello, may I ask if this is Teacher Wang Jiayin’s class? 
A mind‑blowing course that uses equally mind‑blowing textbooks. If you want a high score, it’s recommended to study it as a liberal‑arts student—memorize everything on the PPT if you can. For the remaining algorithms in the book, learn them by checking the corresponding explanations on Bilibili or OIwiki.
6 Likes
Will the final exam have the original PPT questions? 
Yes, there are also some obscure memorization items in the PPT. Overall, this course is orthogonal to algorithm proficiency; if you want a high score, just treat it like the Marxist theory and Maoist concepts class.
1 Like
Yes, are we in the same class? 
1 Like
Yes 
Yesterday I even talked with a certain 
friend (I unilaterally sought help) about the National Day lab 
1 Like
Text