Skip to content

docs: add English README #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
webbrain-one wants to merge 1 commit into
base: master
Choose a base branch
from
Open

docs: add English README #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions README.en-US.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
# introductionToAlgorithms

### Review Plan

1. Complete basic data structures

- [x] Linked List
- [x] Stack
- [x] Queue
- [x] Binary Tree, Binary Search Tree, Red-Black Tree, Balanced Tree, Trie
- [x] Heap, Graph

2. Basic algorithms
- [x] Sorting algorithms (Heap Sort, Quick Sort, Merge Sort, Bubble Sort)
- [x] Naive matching, Rabin-Karp algorithm (saves computation time for m), KMP string matching algorithm
- [x] Graph algorithms (Minimum Spanning Tree, Shortest Path, Depth-First Search, Breadth-First Search)
- [x] Dynamic Programming (need to try more scenarios and encounter more transition equations)
- [x] Union-Find
- [x] LRU, LFU