Picture 1 of 3
Gallery
Picture 1 of 3
Have one to sell?
The Algorithm Design Manual - Hardcover By Skiena, Steven S
US $19.98
ApproximatelyS$ 25.64
Condition:
“Book shows little signs of wear. No writing/highlighting.”
Good
A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Media MailTM.
Located in: Longmeadow, Massachusetts, United States
Delivery:
Estimated between Thu, 11 Sep and Tue, 16 Sep to 94104
Returns:
No returns accepted.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:127310993250
Item specifics
- Condition
- Good
- Seller Notes
- “Book shows little signs of wear. No writing/highlighting.”
- Brand
- Unbranded
- MPN
- Does not apply
- ISBN
- 9781848000698
About this product
Product Identifiers
Publisher
Springer London, The Limited
ISBN-10
1848000693
ISBN-13
9781848000698
eBay Product ID (ePID)
64411747
Product Key Features
Number of Pages
Xvi, 730 Pages
Publication Name
Algorithm Design Manual
Language
English
Subject
Programming / General, Software Development & Engineering / General, Programming / Algorithms
Publication Year
2011
Type
Textbook
Subject Area
Computers
Format
Hardcover
Dimensions
Item Weight
37.4 Oz
Item Length
9.3 in
Item Width
7 in
Additional Product Features
Edition Number
2
Intended Audience
Scholarly & Professional
Dewey Edition
22
Reviews
From the reviews of the second edition: "...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography … make the book an invaluable resource for everyone interested in the subject." (ACM Computing Reviews) "My absolute favorite for this kind of interview preparation is Steven Skiena's The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace … graph problems are -- they should be part of every working programmer's toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. … every 1 pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Steve Yegge's Blog, March, 2008) "For a decade, Steven Skiena's Algorithm Design Manual retained its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. It is now available in an improved second edition that is worth buying simply for the updates. … Every programmer should read this book, and anyone working in the field should keep it close to hand. … Would I recommend it? Absolutely. This is the best investment … a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education, November, 2008) "Addressing the main difficulties of solving problems, this book goes far beyond the design of algorithms. It is essential for scientists, engineers, and any professionals who aim to solve problems, with a noticeable emphasis on real problems. It will not only serve as a valuable undergraduate textbook, but it will also become an irreplaceable reference guide for most professionals in the area." (Carlos Linares Lopez, Computing Reviews, February, 2009) "Skiena focuses on the practical aspects of algorithm design and use. … this work fills an important gap in the knowledge of CS practitioners and students. … this book is suitable as a text for an undergraduate algorithms class, but also as an invaluable reference for the practicing programmer. … This second edition has updated the bibliography to include recent works, making it an extensive bibliography. The index is also thorough and very useful for finding specific problems." (William Fahle, ACM Computing Reviews, December, 2008) Algorithms are the very heart of computing … . This book is about right for most people. … Each of the topics is treated in a readable informal style with lots of asides and accounts of personal experiences - 'war stories' in implementing algorithms. … If you want to use it as a course textbook then there are lots of exercises at the end of every chapter. Highly recommended. (Mike James, I Programmer, September, 2009) The Algorithm Design Manual by Steven Skiena is aimed at two groups of people: students and professionals. … It is written in an informal style that I found pleasant and engaging. … The book's unique structure makes it more likely to be immediately useful to the practitioner who has problem to solve and wants to quickly make progress … . the book succeeds admirably. … would be helpful to the student who has never seen this material before. … Overall, I recommend this book warmly. (Neelakantan Kartha, The Book Review Column, 2011), From the reviews of the second edition: "...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography ... make the book an invaluable resource for everyone interested in the subject." (ACM Computing Reviews) "My absolute favorite for this kind of interview preparation is Steven Skiena's The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace ... graph problems are -- they should be part of every working programmer's toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. ... every 1 - pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Steve Yegge's Blog, March, 2008) "For a decade, Steven Skiena's Algorithm Design Manual retained its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. It is now available in an improved second edition that is worth buying simply for the updates. ... Every programmer should read this book, and anyone working in the field should keep it close to hand. ... Would I recommend it? Absolutely. This is the best investment ... a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education, November, 2008) "Addressing the main difficulties of solving problems, this book goes far beyond the design of algorithms. It is essential for scientists, engineers, and any professionals who aim to solve problems, with a noticeable emphasis on real problems. It will not only serve as a valuable undergraduate textbook, but it will also become an irreplaceable reference guide for most professionals in the area." (Carlos Linares Lopez, Computing Reviews, February, 2009) "Skiena focuses on the practical aspects of algorithm design and use. ... this work fills an important gap in the knowledge of CS practitioners and students. ... this book is suitable as a text for an undergraduate algorithms class, but also as an invaluable reference for the practicing programmer. ... This second edition has updated the bibliography to include recent works, making it an extensive bibliography. The index is also thorough and very useful for finding specific problems." (William Fahle, ACM Computing Reviews, December, 2008) "Algorithms are the very heart of computing ... . This book is about right for most people. ... Each of the topics is treated in a readable informal style with lots of asides and accounts of personal experiences - 'war stories' in implementing algorithms. ... If you want to use it as a course textbook then there are lots of exercises at the end of every chapter. Highly recommended." (Mike James, I Programmer, September, 2009) "The Algorithm Design Manual by Steven Skiena is aimed at two groups of people: students and professionals. ... It is written in an informal style that I found pleasant and engaging. ... The book's unique structure makes it more likely to be immediately useful to the practitioner who has problem to solve and wants to quickly make progress ... . the book succeeds admirably. ... would be helpful to the student who has never seen this material before. ... Overall, I recommend this book warmly." (Neelakantan Kartha, The Book Review Column, 2011), From the reviews of the second edition:"...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography … make the book an invaluable resource for everyone interested in the subject." (ACM Computing Reviews)"My absolute favorite for this kind of interview preparation is Steven Skiena's The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace … graph problems are -- they should be part of every working programmer's toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. … every 1 pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Steve Yegge's Blog, March, 2008)"For a decade, Steven Skiena's Algorithm Design Manual retained its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. It is now available in an improved second edition that is worth buying simply for the updates. … Every programmer should read this book, and anyone working in the field should keep it close to hand. … Would I recommend it? Absolutely. This is the best investment … a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education, November, 2008)"Addressing the main difficulties of solving problems, this book goes far beyond the design of algorithms. It is essential for scientists, engineers, and any professionals who aim to solve problems, with a noticeable emphasis on real problems. It will not only serve as a valuable undergraduate textbook, but it will also become an irreplaceable reference guide for most professionals in the area." (Carlos Linares Lopez, Computing Reviews, February, 2009)"Skiena focuses on the practical aspects of algorithm design and use. … this work fills an important gap in the knowledge of CS practitioners and students. … this book is suitable as a text for an undergraduate algorithms class, but also as an invaluable reference for the practicing programmer. … This second edition has updated the bibliography to include recent works, making it an extensive bibliography. The index is also thorough and very useful for finding specific problems." (William Fahle, ACM Computing Reviews, December, 2008)Algorithms are the very heart of computing … . This book is about right for most people. … Each of the topics is treated in a readable informal style with lots of asides and accounts of personal experiences - 'war stories' in implementing algorithms. … If you want to use it as a course textbook then there are lots of exercises at the end of every chapter. Highly recommended. (Mike James, I Programmer, September, 2009)The Algorithm Design Manual by Steven Skiena is aimed at two groups of people: students and professionals. … It is written in an informal style that I found pleasant and engaging. … The book's unique structure makes it more likely to be immediately useful to the practitioner who has problem to solve and wants to quickly make progress … . the book succeeds admirably. … would be helpful to the student who has never seen this material before. … Overall, I recommend this book warmly. (Neelakantan Kartha, The Book Review Column, 2011), From the reviews of the second edition: "...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography 'e¦ make the book an invaluable resource for everyone interested in the subject." (ACM Computing Reviews) "My absolute favorite for this kind of interview preparation is Steven Skiena'e(tm)s The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace 'e¦ graph problems are -- they should be part of every working programmer'e(tm)s toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. 'e¦ every 1 'e" pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Steve Yegge'e(tm)s Blog, March, 2008) "For a decade, Steven Skiena'e(tm)s Algorithm Design Manual retained its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. It is now available in an improved second edition that is worth buying simply for the updates. 'e¦ Every programmer should read this book, and anyone working in the field should keep it close to hand. 'e¦ Would I recommend it? Absolutely. This is the best investment 'e¦ a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education, November, 2008) "Addressing the main difficulties of solving problems, this book goes far beyond the design of algorithms. It is essential for scientists, engineers, and any professionals who aim to solve problems, with a noticeable emphasis on real problems. It will not only serve as a valuable undergraduate textbook, but it will also become an irreplaceable reference guide for most professionals in the area." (Carlos Linares Lopez, Computing Reviews, February, 2009) "Skiena focuses on the practical aspects of algorithm design and use. 'e¦ this work fills an important gap in the knowledge of CS practitioners and students. 'e¦ this book is suitable as a text for an undergraduate algorithms class, but also as an invaluable reference for the practicing programmer. 'e¦ This second edition has updated the bibliography to include recent works, making it an extensive bibliography. The index is also thorough and very useful for finding specific problems." (William Fahle, ACM Computing Reviews, December, 2008) 'eoeAlgorithms are the very heart of computing 'e¦ . This book is about right for most people. 'e¦ Each of the topics is treated in a readable informal style with lots of asides and accounts of personal experiences - 'e~war stories'e(tm) in implementing algorithms. 'e¦ If you want to use it as a course textbook then there are lots of exercises at the end of every chapter. Highly recommended.'e� (Mike James, I Programmer, September, 2009) 'eoeThe Algorithm Design Manual by Steven Skiena is aimed at two groups of people: students and professionals. 'e¦ It is written in an informal style that I found pleasant and engaging. 'e¦ The book'e(tm)s unique structure makes it more likely to be immediately useful to the practitioner who has problem to solve and wants to quickly make progress 'e¦ . the book succeeds admirably. 'e¦ would be helpful to the student who has never seen this material before. 'e¦ Overall, I recommend this book warmly.'e� (Neelakantan Kartha, The Book Review Column, 2011)
TitleLeading
The
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
005.1
Table Of Content
Practical Algorithm Design.- to Algorithm Design.- Algorithm Analysis.- Data Structures.- Sorting and Searching.- Graph Traversal.- Weighted Graph Algorithms.- Combinatorial Search and Heuristic Methods.- Dynamic Programming.- Intractable Problems and Approximation Algorithms.- How to Design Algorithms.- The Hitchhiker's Guide to Algorithms.- A Catalog of Algorithmic Problems.- Data Structures.- Numerical Problems.- Combinatorial Problems.- Graph Problems: Polynomial-Time.- Graph Problems: Hard Problems.- Computational Geometry.- Set and String Problems.- Algorithmic Resources.
Synopsis
Expanding on the highly successful formula of the first edition, this book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms., Most professional programmers that I've encountered are not well prepared to tacklealgorithmdesignproblems.Thisisapity, becausethetechniquesofalgorithm design form one of the core practical technologies of computer science. Designing correct, e'cient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: - Techniques - Good algorithm designers understand several fundamental - gorithm design techniques, including data structures, dynamic programming, depth-?rst search, backtracking, and heuristics. Perhaps the single most - portantdesigntechniqueismodeling, theartofabstractingamessyreal-world application into a clean problem suitable for algorithmic attack. - Resources - Good algorithm designers stand on the shoulders of giants. Ratherthanlaboringfromscratchtoproduceanewalgorithmforeverytask, they can ?gure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing imp- mentations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide su'cient source material to model most any application. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals., Most professional programmers that I've encountered are not well prepared to tacklealgorithmdesignproblems.Thisisapity,becausethetechniquesofalgorithm design form one of the core practical technologies of computer science. Designing correct, e'cient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: * Techniques - Good algorithm designers understand several fundamental - gorithm design techniques, including data structures, dynamic programming, depth-?rst search, backtracking, and heuristics. Perhaps the single most - portantdesigntechniqueismodeling,theartofabstractingamessyreal-world application into a clean problem suitable for algorithmic attack. * Resources - Good algorithm designers stand on the shoulders of giants. Ratherthanlaboringfromscratchtoproduceanewalgorithmforeverytask, they can ?gure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing imp- mentations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide su'cient source material to model most any application. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals., This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques , provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources , is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: * Doubles the tutorial material and exercises over the first edition * Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video * Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them * Includes several NEW "war stories" relating experiences from real-world applications * Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java
LC Classification Number
QA75.5-76.95
Item description from the seller
Seller feedback (215)
- eBay automated feedback- Feedback left by buyer.Past monthOrder completed successfully—tracked and on time
- t***o (22593)- Feedback left by buyer.Past monthVerified purchaseGreat condition and fast shipping for a nice price. Thanks!
- eBay automated feedback- Feedback left by buyer.Past monthOrder completed successfully—tracked and on time