- 2024/5/6 12:00 - 5/7 22:00 : Chapter 2 Getting Started
- 5/7 22:00 - 5/8 22:10: Chapter 3: Characterizing Running Times, page 71-98
- 5/8 22:10 - 5/12 19:30 : Chapter 4: Divide-and-Conquer, page 98-148
- 5/12 19:30 - 5/17 8:30: Chapter 5: Probabilistic Analysis and Randomized Algorithms
- 5/17 8:30 - 5/18 15:40 : Chapter 6: Heapsort, page 178-204
- 5/18 15:40 - 5/20 19:00: Chapter 7: Quicksort, page 204-227
- 5/20 19:00 - 5/23 8:30 : Chapter 8: Sorting in Linear Time, page 227-249
- 5/23 8:30 - 5/25 10:30: Chapter 9: Medians and Order Statistics, page 249-270
- 5/25 10:30 - 5/26 6:30: Chapter 10: Elementary Data Structures , page 270-294
- 5/26 6:30 - 5/27 23:00: Chapter 11: Hash Tables, page 294-334
"We hope that this textbook provides you with an enjoyable introduction to the field of algorithms. We have attempted to make every algorithm accessible and interesting. Enjoy it !"
https://github.com/walkccc/CLRS
https://walkccc.me/CLRS/
https://sites.math.rutgers.edu/~ajl213/CLRS/CLRS.html
https://github.com/walkccc/CLRS-cpp