Author: George Heineman, Gary Pollice, Stanley Selkow Publisher:O'Reilly,2008 Pages: 326 ISBN: 9780596516246 Aimed at: Professional developers Rating: 5 Pros: A readable and informative book you will want to refer to for years to come Cons: Reviewed by: Mike James
Algorithm books aren’t entirely new, but this one is a little different. A standard algorithm book simply presents common or classic algorithms to do a range of things in the language of choice. Some of them, like Donald Knuth’s classic, “The Art of Computer Programming”, indulge in detailed mathematical analysis of the efficiency and properties of the algorithms. This book, however, isn’t at all academic and it’s a very good and easy read.
The first chapter presents a case study describing how, despite the best intentions of the programmers concerned, selecting an algorithm for a particular job is difficult. The account is interesting and well told, a sort of “who dunit” and it doesn’t matter that it's obvious that it was the algorithm that did it. Following this there is an introduction to the ideas involved in evaluating and understanding algorithms. Even if you know about “big O” notation it makes a good refresher course.
From here we launch into a consideration of algorithms by type with searching and sorting being the obvious place to start. Each algorithm is placed into its context and an explanation of how it works is given. Example code is mostly in C or C++ but it doesn’t really matter because if you know any block structured language you will be able to follow the examples. What is important to emphasis is that while the book presents the properties of the algorithms without trying to oversimplify you are not subjected to long derivations of the execution times or space requirements. The whole presentation is informal but informative at just the right level for a working programmer. Moving on from the essential skills of searching and sorting the following chapters are more varied and less universally useful: Graph algorithms (e.g. shortest path), Path finding in AI (e.g. Minimax, Alphabeta pruning), Network flow (e.g. Max flow, Linear Programming) and Computational Geometry (Convex Hull, Nearest Neighbour). Clearly which algorithms are of interest depends on what you are working on but the selection covers a useful range and you can expect to encounter them all in a reasonable programming career.
The final part of the book deals with slightly more exotic topics such as what to do when you can’t get an algorithm to suit – including go parallel and try randomised algorithms. The Epilog ends the book with a collection of “principes” that you should apply to your interaction with algorithms. Take to heart the last one – “Writing Algorithms Is Hard – Testing Algorithms is Harder”. Despite is not covering much of the academic analysis needed for a computer science course it would also make a really good basis for such a course or background reading.
This book is a “keeper”  make room for it on your bookshelf as it’s essential reading.
<ASIN:0072970545>
<ASIN:0321358287>
jQuery Pocket Primer
Author: Oswald Campesato Publisher: Mercury Learning Date: June 26, 2014 Pages: 200 ISBN: 9781938549144 Print: 1938549147 Kindle: B00V585GBY Audience: JavaScript programmers Rating: 2 Reviewer: Ian Elliot
jQuery is a sophisticated JavaScript Toolbox can a pocket primer [ ... ]

Gray Hat C#
Author: Brandon Perry Publisher: No Starch Press Pages: 304 ISBN: 9781593277598 Print: 1593277598 Kindle: B074LSP4H5 Audience: Developers interested in security Rating: 5 Reviewer: Kay Ewbank
How can you find the security weaknesses in programming projects? This book takes you through a [ ... ]
 More Reviews 
