diff --git a/docs/数据结构与算法/CS170.en.md b/docs/数据结构与算法/CS170.en.md index b5d00017..aef54092 100644 --- a/docs/数据结构与算法/CS170.en.md +++ b/docs/数据结构与算法/CS170.en.md @@ -8,17 +8,17 @@ - Difficulty: 🌟🌟🌟 - Class Hour: 60 hours -Berkeley's algorithm design course which focuses more on the theoretical foundations and complexity analysis of algorithms. The course covers Divide-and-Conquer, Graph Algorithms, Shortest Paths, Spanning Trees, Greedy Algorithms, Dynamic programming, Union Finds, Linear Programming, Network Flows, NP-Completeness, Randomized Algorithms, Hashing, etc. +This is Berkeley's algorithm design and analysis course. It focuses on the theoretical foundations and complexity analysis of algorithms, covering Divide-and-Conquer, Graph Algorithms, Shortest Paths, Spanning Trees, Greedy Algorithms, Dynamic programming, Union Finds, Linear Programming, Network Flows, NP-Completeness, Randomized Algorithms, Hashing, etc. -The textbook for this course is well written and the proofs in it are easy to understand and very suitable as a reference book. In addition, this class has only written assignments and is recommended to be written in LaTeX, so you can take this opportunity to practice your LaTeX skills. +The textbook for this course is well written and very suitable as a reference book. In addition, this class has written assignments and is recommended to use LaTeX. You can take this opportunity to practice your LaTeX skills. ## Course Resources - Course Website: - Recordings: -- Recordings: refer to course website -- Assignments: refer to course website +- Recordings: refer to the course website +- Assignments: refer to the course website ## Personal Resources -All the resources and assignments used by @PKUFlyingPig in this course are maintained in [PKUFlyingPig/UCB-CS170 - GitHub](https://github.com/PKUFlyingPig/UCB-CS170) \ No newline at end of file +All the resources and assignments used by @PKUFlyingPig in this course are maintained in [PKUFlyingPig/UCB-CS170 - GitHub](https://github.com/PKUFlyingPig/UCB-CS170)