| Algorithmic Puzzles Contributor(s): Levitin, Anany (Author), Levitin, Maria (Author) |
|
 |
ISBN: 0199740445 ISBN-13: 9780199740444 Publisher: Oxford University Press, USA OUR PRICE: $38.94 Product Type: Paperback Published: October 2011 * Not available - Not in print at this time * |
| Additional Information |
| BISAC Categories: - Mathematics | Recreations & Games - Mathematics | Probability & Statistics - General |
| Dewey: 793.74 |
| LCCN: 2010052043 |
| Physical Information: 0.57" H x 6.1" W x 9.22" (0.88 lbs) 280 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures. The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary on the puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking through more difficult puzzles. |