docs: add English README

README.en-US.md

@@ -0,0 +1,48 @@
+
+
+# Introduction to Algorithms
+
+The Python implementation of the algorithm in the third edition of "Introduction to Algorithms" .
+
+### Part One: Foundations
+- [x] chapter 1 **The Role of Algorithms in Computing**
+- [x] chapter 2 **Algorithm Basics**
+- [x] chapter 3 **Growth of Functions**
+- [x] chapter 4 **Divide-and-Conquer**
+- [x] chapter 5 **Probabilistic Analysis and Randomized Algorithms**
+### Part Two: Sorting and Order Statistics
+- [x] chapter 6 **Heapsort**
+- [x] chapter 7 **Quicksort**
+- [x] chapter 8 **Sorting in Linear Time**
+- [x] chapter 9 **Medians and Order Statistics**
+### Part Three: Data Structures
+- [x] chapter 10 **Elementary Data Structures**
+- [x] chapter 11 **Hash Tables**
+- [x] chapter 12 **Binary Search Trees**
+- [x] chapter 13 **Red-Black Trees**
+- [x] chapter 14 **Extending Data Structures**
+### Part Four: Advanced Design and Analysis Techniques
+- [x] chapter 15 **Dynamic Programming**
+- [ ] chapter 16 **Greedy Algorithms** :bicyclist: :bicyclist: :bicyclist:
+- [ ] chapter 17 **Amortized Analysis**
+### Part Five: Advanced Data Structures
+- [ ] chapter 18 **B-Trees**
+- [ ] chapter 19 **Fibonacci Heaps**
+- [ ] chapter 20 **van Emde Boas Trees**
+- [ ] chapter 21 **Data Structures for Disjoint Sets**
+### Part Six: Graph Algorithms
+- [ ] chapter 22 **Elementary Graph Algorithms**
+- [ ] chapter 23 **Minimum Spanning Trees**
+- [ ] chapter 24 **Single-Source Shortest Paths**
+- [ ] chapter 25 **All-Pairs Shortest Paths**
+- [ ] chapter 26 **Maximum Flow**
+### Part Seven: Topics in Algorithms
+- [ ] chapter 27 **Multithreaded Algorithms**
+- [ ] chapter 28 **Matrix Operations**
+- [ ] chapter 29 **Linear Programming**
+- [ ] chapter 30 **Polynomials and the FFT**
+- [ ] chapter 31 **Number-Theoretic Algorithms**
+- [ ] chapter 32 **String Matching**
+- [ ] chapter 33 **Computational Geometry**
+- [ ] chapter 34 **NP-Completeness**
+- [ ] chapter 35 **Approximation Algorithms**