XeLabs/cs-self-learning
2
0
Fork 0
mirror of https://github.com/PKUFlyingPig/cs-self-learning.git synced 2026-06-23 18:06:56 +08:00
Code Issues Projects Releases Packages Wiki Activity

[TRANSLATION]translate CS170.md

Browse source
This commit is contained in:
smxm 2022-10-03 18:43:06 +08:00 committed by GitHub
parent 33240b7274
commit 8474931d0f
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 24 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

24
docs/数据结构与算法/CS170.en.md Normal file
View file

@ -0,0 +1,24 @@
# CS170: Efficient Algorithms and Intractable Problems
## Descriptions
- Offered by: UC Berkeley
- Prerequisites: CS61B, CS70
- Programming Languages: LaTeX
- 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.
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.
## Course Resources
- Course Website: <https://cs170.org/>
- Recordings: <https://www.youtube.com/playlist?list=PLnocShPlK-Ft-o7NInBDw18be86dNaxlT>
- Recordings: refer to course website
- Assignments: refer to 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)