Add MIT 6.006 (En)

docs/数据结构与算法/6.006.en.md

@@ -0,0 +1,22 @@
+# MIT 6.006: Introduction to Algorithms
+
+## Descriptions
+
+- Offered by: MIT
+- Prerequisites: Introductory level courses (CS50/CS61A/CS106A or equivalent)
+- Programming Languages: Python
+- Difficulty: 🌟🌟🌟🌟🌟
+- Class Hour: 100 hours+
+
+Probably the most precious course from the EECS department of MIT. Taught by Erik Demaine, one of the geniuses in Algorithms.
+
+Compared with CS106B/X (Data structures and algorithms using C++), 6.006 emphasizes the algorithms more. It also covers several classical data structures such as AVL trees. You may use it to learn more about algorithms after CS106B/X.
+
+相比较于斯坦福的CS106B/X（C++描述的数据结构与算法），该课程更侧重于算法方面的详细讲解。课程也覆盖了一些经典的数据结构，如AVL树等。个人感觉在讲解方面比CS106B更加详细，也弥补了CS106B在算法方面讲解的不足。适合在CS106B入门之后巩固算法知识。
+
+## Course Resources
+
+- Course Website: [Fall 2011](https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/)
+- Recordings: [Fall 2011](https://www.bilibili.com/video/BV1b7411e7ZP)
+- Textbooks: Introduction to Algorithms (CLRS)
+- Assignments: [Fall 2011](https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/pages/assignments/)