diff --git a/docs/数据结构与算法/CS170.en.md b/docs/数据结构与算法/CS170.en.md
new file mode 100644
index 00000000..b5d00017
--- /dev/null
+++ b/docs/数据结构与算法/CS170.en.md
@@ -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)
\ No newline at end of file