DeepRead
Cover of Algorithms unlocked

Algorithms unlocked

Thomas H. Cormen · 2013

Programming and computer science › Algorithms and coding interviews

#4,744 most recommended

About the book

The book is a non-technical introduction to computer algorithms: what they are, how they are written down, and how their efficiency is judged. It covers searching, sorting, graph problems such as finding shortest routes, string matching, the basics of cryptography and data compression, and the existence of problems that cannot be solved efficiently. Algorithms are step-by-step procedures that let computers solve problems, and their core ideas can be understood without heavy mathematics. Evaluating an algorithm mainly means asking how its running time grows as the input grows. Some problems have no known efficient algorithm, which limits what computers can do in practice.

Written by Claude from what it knows of this book.

What Hacker News says 88% recommend · 0% critical

0242013201420162018202020212013 peak · 2
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
  • 1 reading
  • 0 have read

Open Library’s page for the book

What Wikipedia says

  • published 2013
  • 240 pages
  • articles in 4 languages

Read the Wikipedia article

Reddit communities — coming later

The threads it came up in

Details

First published
2013
ISBN
9780262518802
Editions known
8 at Open Library
Open Library
OL17832792W

COMPUTERS / Programming / Open SourceCOMPUTERS / Software Development & Engineering / GeneralCOMPUTERS / Software Development & Engineering / ToolsComputer algorithms

Explore in the mosaic

Read next: its neighbours on the mosaic