search

walkccc / CLRS

📚 Solutions to Introduction to Algorithms Third Edition
https://walkccc.me/CLRS
MIT License
4.65k stars 1.26k forks source link

Update 4.3.md #375

Closed yanomateus closed 3 years ago

yanomateus commented 3 years ago

The pt_BR translation I have from CLRS 3rd edition states the recurrence T(n) = 4T(n/2) + n, for which I provide a solution in this PR. The "n^2" has probably been misread. I'd be nice if someone could double check the original american 3rd edition.

walkccc commented 3 years ago

Hi @yanomateus, sorry for the late reply. According to https://www.cs.dartmouth.edu/~thc/clrs-bugs/bugs-3e.php This problem is listed in the errata in the first printing.

I've updated it. Thank you!