CLRS
CLRS copied to clipboard
walkccc
📚 Solutions to Introduction to Algorithms Third Edition
Hello there, I think the right algo for 2.1.4 is with `C[i] = A[i] + B[i] + r`. Current solution shift binary operation to the left and final operation overwrite...
Hi, all! The book (I have the 3rd edition) claims that for BFS we can `remove` lines 5 and 14 of the original algorithm and this modified procedure should produce...
If 'i' is a leaf node and when A[i] > A[A.heap_size], the max_heapify function does not work in that case as the leaf node does not have any left or...
I noticed that for the solution to problem 21.3-1, only the resulting data structure was provided but the data structure doesn't show the path compression done and it also has...
The solution given now is ``` RELAX(u, v, w) if v.d > min(w(u, v), w(u, v) + u.d) v.d = min(w(u, v), w(u, v) + u.d) v.π = u.π ```...
5.2-4
sum(1/n)=1? 1/n is divergent. Why can it be 1? 
1 second equals 1000 milliseconds. t=1000. f(n)=n=1000=10^3. why is 10^6 
The answer only proves 1. Bellman-Ford algorithm maximizes $\min\{x_i\}$ and 2. Largest value of Bellman-Ford algorithm's result is always $0$ But we cannot draw the conclusion that $(\max\{x_i\}-\min\{x_i\})$ is minimized....
I guess this solution is not correct because the last equation does not prove hypothesis.
You have written the function d-ARY-CHILD(i, j) in par. a, in par.c you are using d-ARY-CHILD(k, i), which is not correct. It should be d-ARY-CHILD(i, k). Moreover, I find no...