CLRS

CLRS copied to clipboard

There seems to be a typo: should be square of logarithm of n, not logarithm of n squared: 

rualark

Solution seems correct except result of ruby program. Number of people required to have two people with fixed birthday must be greater than number of people required to have one...

rualark

For ***b***, you first suppose T(k)

ywxktc

I noticed that the appendices are not included. I would be happy to type up at least the problem descriptions along with some of the solutions. For reference, the appendices...

qstratton

Could not understand 3.2.4

1

Hi there, Thank you for helping us out. I do not have an issue but need help on understanding this: =Θ(lg n lg lg n) =ω(lg n) ​How did you...

SachinBahukhandi

For left rotation, it also relies on the length of left spine of x's parent. No evidence clarify the two lengths(x's left spine and x's parent's left spine) are the...

run27017

For this problem, I get some wonders: ## part a In answer a, it says the Fibonacci numbers recurrence is: > T(h)=T(h−1)+T(h−2)+1 But in my mind, the Fibonacci numbers recurrence...

run27017

https://walkccc.github.io/CLRS/Chap03/Problems/3-6/ The table on the above page does not match the one found in the book.  * [I am using the 3rd edition...

noahabe

Exercise 4.5-5

2

**The answer is correct，but the process of the proof is wrong.** It asks us to prove a \* f(n/b)≤c \* f(n) for c

clear-life

Exercise 3.2-3

1

In the solution for excercise 3.2-3 the formulas of the second and third equation are wrong. Additionally your proofs disprove your formulas. _Hereinafter I reference pages of the fifth print...

pdulich