Algorithms Illuminated teaches the basics of algorithms in the most accessible way imaginable, with thorough coverage of asymptotic analysis, graph search and shortest paths, data structures, divide-and-conquer algorithms, greedy algorithms, dynamic programming, and NP-hard problems.
I have a question about the book:
‘Algorithms Illuminated - Roughgarden, Tim (Columbia University’.
Fill in the form below.
We will respond as fast as possible.
