Need help with CLRS?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

gzc
6.8K Stars 2.3K Forks MIT License 693 Commits 77 Opened issues

Description

:notebook:Solutions to Introduction to Algorithms

Services available

!
?

Need anything else?

Contributors list

Solutions to CLRS.

Solutions to Introduction to Algorithms by Charles E. Leiserson, Clifford Stein, Ronald Rivest, and Thomas H. Cormen (CLRS).

Contributor

  1. Soyn
  2. idf
  3. W4anD0eR96
  4. knight42
  5. ajinkyakolhe112
  6. an-yun
  7. y1y
  8. RepapLataf
  9. Ghost---Shadow
  10. wonjunetai
  11. suensky
  12. xwu64
  13. ryuxin
  14. Puriney
  15. wild-flame
  16. zhangysh1995
  17. DarthUjj
  18. VMatrix1900
  19. Jingru
  20. prasook-jain
  21. Mundhey
  22. Cokile
  23. wuchichung
  24. saurabhvyas
  25. codemukul95
  26. JasonQSY
  27. imbrobits
  28. zhanglanqing
  29. tushar-rishav
  30. ravgill
  31. Mad_Kingu

If I miss your name here, please pull a request to me to fix.

You maybe interested in another repo gitstats which generates repo contribution of CLRS.

This repo needs your help.

If you are interested in this project, you could complete problems which are marked "UNSOLVED" in the following list. Or if you are interested in certain chapters that have not been completed, you could fork this project and issue a pull request to this repo. Appreciate your efforts.

如果你感兴趣,可以完成没有完成的题(下面有个UNSOLVED列表),或者如果你对某章节感兴趣想要完成,可以fork这个项目然后pull request进这个repo。

In order to speed up this project, we will ignore any hard problems (for instance, problems in the very end of each chapter) and review them when finishing mediocre problems. Moreover, we will only focus on sections that are interesting. You could also help to finish these hard problems.

If a problem is too easy to solve, we'll mark it as straightforward in order to speed up the progress.


Chapter Section
Part I: Foundations
I 1 2 p
II 1 2 3 p
III 1 2 p
IV 1 2 3 4 p
V 1 2 3 4 p
Part II: Sorting and Order Statistics
VI 1 2 3 4 5 p
VII 1 2 3 4 p
VIII 1 2 3 4 p
IX 1 2 3 p
Part III: Data Structures
X 1 2 3 4 p
XI 1 2 3 4 5 p
XII 1 2 3
XIII 1 2 3 4 p
XIV 1 2 3 p
Part IV: Advanced Design and Analysis Techniques
XV 1 2 3 4 5
XVI 1 2 3
XVII 1 2
Part V: Advanced Data Structures
XVIII 1 2 3
XIX 1 2
XXI 1 2 3
Part VI: Graph Algorithms
XXII 1 2 3 4 5 p
XXIII 1 2
XXIV 1 2 3 4
XXV 1 2 3
XXVI 1 2 3
Part VII: Selected Topics
XXXI 1 2
XXXII 1 2 3 4
XXXIII 1
XXXV 1

Data Structure&algorithm implementation

BASIC

DIVIDE and CONQUER

TREE/ADVANCED

DYNAMIC/GREEDY

GRAPH

GEOMETRY

STRING

UTILITY

UNSOLVED

31.1.11 31.2.7 31.2.9

32.2.4 32.3.4 32.4.6


Follow @louis1992 on github to help finish this task.

Disclaimer: the solutions in this repository are crowdsourced work, and in any form it neither represents any opinion of nor affiliates to the authors of Introduction to Algorithms or the MIT press.

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.