📓Solutions to Introduction to Algorithms
Switch branches/tags
Nothing to show
Clone or download
gzc Merge pull request #252 from zouyonghao/patch-1
7.2-1 substitution method
Latest commit 9d18afc Jul 28, 2018
Permalink
Failed to load latest commit information.
C01-The-Role-of-Algorithms-in-Computing Update 1.1.md Jan 27, 2018
C02-Getting-Started Update 2.3.md May 31, 2018
C03-Growth-of-Functions Update 3.2.md Apr 4, 2018
C04-Recurrences These steps are not sufficient to prove Theta(n^2) Mar 3, 2018
C05-Probabilistic-Analysis-and-Randomized-Algorithms Add files via upload Jul 26, 2018
C06-Heapsort Update 6.2.md Jul 25, 2018
C07-Quicksort 7.2-1 substitution method Jul 26, 2018
C08-Sorting-in-Linear-Time escape all whitespace characters in md image links to make them prope… Aug 2, 2017
C09-Medians-and-Order-Statistics Fix some bug Oct 22, 2017
C10-Elementary-Data-Structures Update 10.2.md May 13, 2018
C11-Hash-Tables Update 11.4.md Jun 5, 2018
C12-Binary-Search-Trees Cleaned files Oct 28, 2017
C13-Red-Black-Trees removed accidental 'e' in the text Jan 15, 2018
C14-Augmenting-Data-Structures Ex. 14.3-3 change Nov 21, 2017
C15-Dynamic-Programming Merge pull request #214 from ravijoshiBITS/master Apr 1, 2018
C16-Greedy-Algorithms Merge pull request #175 from kestory/master Jan 15, 2018
C17-Amortized-Analysis Create 17.4.md Jun 5, 2018
C18-B-Trees Update 18.1.md Aug 17, 2017
C19-Binomial-Heaps Fix broken Markdown headings Apr 18, 2017
C21-Data-Structures-for-Disjoint-Sets update README.md 21.2.md Dec 19, 2017
C22-Elementary-Graph-Algorithms Update 22.3.md May 22, 2018
C23-Minimum-Spanning-Trees fixed typo Aug 25, 2017
C24-Single-Source-Shortest-Paths fix 24.1-1 solution Jul 2, 2017
C25-All-Pairs-Shortest-Paths Update 25.3.md Apr 26, 2017
C26-Flow-networks Fix broken Markdown headings Apr 18, 2017
C31-Number-Theoretic-Algorithms add solution of 31.2-9 Jun 10, 2018
C32-String-Matching made FA more readable, added English solution to 15.4 Mar 14, 2018
C33-Computational-Geometry Fix broken Markdown headings Apr 18, 2017
C35-Approximation-Algorithms Add 35.2-5 problem Jan 23, 2018
other Update stringSpilit.cpp Jul 31, 2017
.gitignore CLRS C02 Jun 14, 2015
LICENSE add LICENSE & add CLRS C11 & reconstruct README Jul 12, 2015
README.md update README.md Dec 19, 2017

README.md

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

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

21.2.5 21.3.4

24.4.9

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.