CLRS
CLRS copied to clipboard
walkccc
📚 Solutions to Introduction to Algorithms Third Edition
Link to the solution: https://walkccc.github.io/CLRS/Chap22/22.3/#223-7 Current stack-based solution is not exactly equivalent to the recursive one. When recursive dfs returns from the recursive call, it proceeds immediately to the next...
I had come up with a similar solution to the one given here. But there's a problem with this answer - since the _huge array_ is filled with **junk** values,...
Not an issue actually, but a note: Algorithm provided in solution is correct. While algorithm here is wrong: https://sites.math.rutgers.edu/~ajl213/CLRS/CLRS.html
I believe the "*delete 38*" diagram is incorrect for this Exercise. The remaining node "**41**" (shown as a ***Red*** node) should be ***Black***. Per red-black property 2 (3rd edition p....
C. Using `i` at the same time for selected element (in the question) and for distance between desired element and selected element (in solution) results in confusion. `i` in solution...
B. When extracting minimal element, there is no need to find second smallest element. Just move last element of list to the beginning of the list. Even if you want...
It is unclear what is the difference between single and double equals sign in 'if' statements. It is unclear what x.left call (and similar) means here: ``` if x ==...
This solution is wrong. Node is passed to function, but node does not have 'root' attribute
This solution is wrong, these are not the closest elements. Correct solution here: https://sites.math.rutgers.edu/~ajl213/CLRS/CLRS.html
1. This solution finds only small part of quantiles. Actually, if k-1 quantiles need to be found, only lgk quantiles are really found. This happens because there is only one...