Hi, Every Programmer! I'm starting walk into Competitive Programming Worlds. And, I have decived to reading and learning with Introduction To Algorithms Book (CLRS) 
! As result, I am needing any help about this book: Guides , Solution, source Code,... etc. Please share for me :)! Any help will be appreciated, thankyou very much and good programming to all friends!
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 163 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | awoo | 158 |
| 6 | atcoder_official | 157 |
| 7 | adamant | 155 |
| 7 | nor | 155 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 148 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/20/2024 07:20:02 (k1).
Desktop version, switch to mobile version.
Supported by
This is a difficult book for a self-learner. (at least for me)
I highly recommend Introduction to Algorithms (SMA 5503) — MIT lectured by one of the coauthors — Prof. Charles Leiserson (The 'L' of CLRS) and Prof. Erik Demaine who is a bright and fantastic teacher (Perhaps you've heard about Cartesian Trees(treaps)?).
I especially love the materials which offer more intuitive (and perhaps easier) proofs.
In case you need solutions when you're stuck, here is a CLRS Study Group.
But note that some solutions are apparently incorrect.
In case you want to know more about CLRS, consider giving Prof. Thomas Cormen (The 'C' of CLRS) a follow on quora :)
It's also worth mentioning that he recommends another book for starters — Algorithms Unlocked
Thankyou lnishan very much, wish best with u!