DeepRead
Cover of Mastering algorithms with C

Mastering algorithms with C

Kyle Loudon, Andy Oram · 1999

Programming and computer science › Algorithms and coding interviews

#4,582 most recommended

About the book

The book covers the fundamental algorithms and data structures of computer science, including linked lists, stacks and queues, trees, graphs, sorting, searching and hashing. Its scope is the basic toolkit a working C programmer needs, organised by algorithm family rather than as a list of isolated routines. The book's central position is that an algorithm is understood best when its underlying theory and its working code are presented together. Each family is introduced through its principles, such as how a method divides or orders its data and what that costs in time and space, and then implemented in C so the reasoning can be tested. It treats these families as reusable patterns that transfer across problems rather than as fixed recipes tied to one application.

Written by Claude from what it knows of this book.

What Hacker News says 33% recommend · 0% critical

0242010201520202010 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.

  • 5 want to read
  • 0 reading
  • 0 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
1999
ISBN
9781565924536
Editions known
6 at Open Library
Open Library
OL222902W

AlgorithmsC (Computer program language)Computer algorithmsData structures (Computer science)Microsoft C.

Explore in the mosaic

Read next: its neighbours on the mosaic