DeepRead
Cover of Algorithms Illuminated

Algorithms Illuminated

Tim Roughgarden · 2018

Programming and computer science › Algorithms and coding interviews

#4,228 most recommended

About the book

An introduction to the design and analysis of algorithms, aimed at self-learners and students preparing for a computer science degree. It covers core topics such as asymptotic analysis, divide and conquer, sorting, randomized algorithms, and basic data structures, with exercises placed throughout each chapter. It is the first volume of a multi-part series. Its central position is that most algorithms can be understood through a small set of recurring design ideas and analytical tools, and that explaining why an algorithm works and how its running time scales matters more than memorizing code. It emphasizes worst-case running time expressed in asymptotic notation. It presents clever techniques, such as splitting a problem recursively or exploiting randomness, as the means by which naive approaches become dramatically faster.

Written by Claude from what it knows of this book.

What Hacker News says 90% recommend · 0% critical

024201820202022202420262021 peak · 3
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 14 want to read
  • 0 reading
  • 1 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2018
ISBN
9780999282946
Editions known
8 at Open Library
Open Library
OL20589558W

Computer algorithmsComputer programming

Explore in the mosaic

Read next: its neighbours on the mosaic