Goodreads helps you keep track of books you want to read.
Start by marking “Essential Algorithms: A Practical Approach to Computer Algorithms” as Want to Read:
Essential Algorithms: A Practical Approach to Computer Algorithms
Enlarge cover
Rate this book
Clear rating
Open Preview

Essential Algorithms: A Practical Approach to Computer Algorithms

3.92  ·  Rating details ·  50 ratings  ·  5 reviews
A friendly and accessible introduction to the most useful algorithms

Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new
...more
Paperback, 301 pages
Published August 12th 2013 by Wiley (first published January 1st 2013)
More Details... Edit Details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about Essential Algorithms, please sign up.

Be the first to ask a question about Essential Algorithms

This book is not yet featured on Listopia. Add this book to your favorite list »

Community Reviews

Showing 1-30
Average rating 3.92  · 
Rating details
 ·  50 ratings  ·  5 reviews


More filters
 | 
Sort order
Start your review of Essential Algorithms: A Practical Approach to Computer Algorithms
Richard
Mar 09, 2015 rated it it was amazing
(This review was originally posted at http://www.cyotek.com/blog/essential-...)

Disclaimer: I received a copy of this book (with a personal signed inscription too :)) directly from Rod with the condition that I review the book. This has not influenced my review except that I have tried to do a decent job rather than just picking a star and saying I liked it.


Quick Overview

The book has quite a few chapters covering a pretty good selection of algorithms, including

* Numerical Algorithms
* Linked
...more
Alexander
Jul 29, 2019 rated it liked it
Shelves: computers
Pros:
- Introduces a good variety of algorithms (Numeric, Probabilistic, Graphical, Network, etc.)
- Has a chapter dedicated to Computational Complexity Theory that explains complexity classes (DTIME, P, EXPTIME, NP, ...)
- Easy to read
- Has solutions to exercises

Cons:
- Atrocious pseudo-code language based on Visual Basic
- Non-standard terminology ("cell" instead of "node", "expected" instead of "average", "multi-threading" meaning multiple links between nodes in a linked list, etc.)
- Irrelevant
...more
Henk Devos
Jun 16, 2017 rated it really liked it
I've read this book to freshen up what I've learned in University, now more than 20 years ago.
If you need to freshen up your algorithm knowledge or even learn the basics for the first time, I can recommend this book.
Егор Лебедев
Dont like it
Mattias Lundell
Mar 15, 2015 rated it it was ok
Shelves: 2015
Covers a lot of thing, not bad but nothing special
Dilshod
rated it it was amazing
Aug 02, 2017
Ella Revzin
rated it it was amazing
Aug 11, 2016
Paramjit
rated it liked it
Aug 12, 2015
Rick Wedgeworth
rated it really liked it
Jun 13, 2015
Subhajit Das
rated it really liked it
Dec 07, 2019
Yuriy
rated it it was amazing
Sep 19, 2016
Rafael Nunes
rated it really liked it
Feb 16, 2020
Miroslav Hudak
rated it really liked it
Mar 02, 2017
Chloe
rated it really liked it
Mar 27, 2016
Nancy
rated it really liked it
Oct 26, 2016
Kyle
rated it liked it
Dec 29, 2014
Ivan Vezhnavets
rated it liked it
Oct 29, 2019
Bakhodir Boydedaev
rated it it was amazing
Jan 04, 2018
TIFFANI MIGLIORE
rated it really liked it
Jan 09, 2016
Fong Yoong
rated it liked it
Feb 13, 2019
Andrew
rated it liked it
Aug 08, 2018
Yves
rated it it was amazing
Nov 07, 2015
Mike Fox
rated it really liked it
Dec 22, 2014
Colin Jack
rated it really liked it
Jan 15, 2016
Sean McArdle
rated it it was amazing
May 08, 2018
Alexander P Yuly
rated it really liked it
May 04, 2017
Stephen Heverin
rated it liked it
Jul 26, 2015
Denis
rated it really liked it
May 11, 2019
Davan
rated it really liked it
Jun 01, 2016
Ryan Hagan
rated it really liked it
Feb 07, 2014
« previous 1 next »
There are no discussion topics on this book yet. Be the first to start one »

Readers also enjoyed

  • Designing Distributed Systems: Patterns and Paradigms for Scalable, Reliable Services
  • Database Design for Mere Mortals: A Hands-On Guide to Relational Database Design
  • Refactoring: Improving the Design of Existing Code
  • Test Driven Development: By Example
  • Clean Architecture
  • The Golden Ticket: P, Np, and the Search for the Impossible
  • The Stainless Steel Rat Gets Drafted (Stainless Steel Rat, #2)
  • Confessions
  • A Stainless Steel Rat is Born (Stainless Steel Rat, #1)
  • The 10x Rule: The Only Difference Between Success and Failure
  • The Book on Rental Property Investing: How to Create Wealth and Passive Income Through Smart Buy & Hold Real Estate Investing
  • Python Machine Learning
  • The Unwritten Laws of Business (Profile Business Classics)
  • Steal This Computer Book 4.0 – What They Won′t Tell You About the Internet 4e
  • The Clean Coder: A Code of Conduct for Professional Programmers
See similar books…

Goodreads is hiring!

If you like books and love to build cool products, we may be looking for you.
Learn more »
“To get the most out of an algorithm, you must be able to do more than simply follow its steps. You need to understand the following: The algorithm's behavior. Does it find the best possible solution, or does it just find a good solution? Could there be multiple best solutions? Is there a reason to pick one “best” solution over the others? The algorithm's speed. Is it fast? Slow? Is it usually fast but sometimes slow for certain inputs? The algorithm's memory requirements. How much memory will the algorithm need? Is this a reasonable amount? Does the algorithm require billions of terabytes more memory than a computer could possibly have (at least today)? The main techniques the algorithm uses. Can you reuse those techniques to solve similar problems?” 2 likes
“Algorithm Characteristics” 0 likes
More quotes…