CLRS
CLRS copied to clipboard
walkccc
š Solutions to Introduction to Algorithms Third Edition
I think there is a major error in the solution for the exercise 4.3.6. We pass from $$T(n) = c(n+34-2a)lg(n+34-2a)-c(n+34-2a)+n$$ to $$T(n) 1 but we then pass from this to...
After sorting of S, a search of two a, b in S such that a + b = x can be improved. ``` FIND-SUM(S, x) // Indexes in S are...
when 41 becomes the root, its color must be changed to black. I would've changed it myself if I only knew how the imgs were generated.
If the recurrence relation is $$ T(n) = T(\lceil n / 2 \rceil) + T(\lfloor n / 2 \rfloor) + \Theta(n) $$ And our inductive hypothesis for the upper bound...
https://github.com/walkccc/CLRS/blob/89279c098f75a5146aa1925c7887a695d9115ba4/docs/Chap02/2.3.md The answer to Exercise 2.3-3 says "By P.M.I., $T(n) = n\lg nT(n)=nlgn$, when n is an exact power of 22. " Does "P.M.I." there mean Principle of Mathematical Induction?
in 13.4-3 step delete 38 the graph with one node 41 should be a black node. because the root node in the red-black tree must be a black node and...
1.2-2
wolfram says it's more like 2 to 26 though. https://www.wolframalpha.com/input/?i=8n%5E2%3D64nlnn
l think the grey block in the picture lost some part?? Since the grey block means the number we compare  the step ādā and āeā should add grey ??
I was wondering if it is possible to generate pdf file for https://github.com/walkccc/CLRS? Thanks!
