Data Structures and Algorithm Analysis in C++
Now Browsing: Textbooks › Algorithms › Data Structures and Algorithm Analysis in C++
Edition: 4th
Published: 2012
Publisher: Addison-Wesley
Format: Hardcover
Pages: 635
ISBN 13: 9780132847377
ISBN 10: 013284737X
- All
- Rent
- Buy
- eBook
- Sell Back
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: Knetbooks, BiggerBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: BiggerBooks, Knetbooks, AbeBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: eCampus
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: Knetbooks, BiggerBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: BiggerBooks, Knetbooks, AbeBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Prices checked Oct 20, 2026, 12:54 AM ET. Prices change often; the store's checkout price is final.
Renting vs. Buying This Textbook
Renting is usually cheapest if you only need the book for one term: you return it with a free prepaid label when the term ends. Buying used can beat renting when the sell-back price is high, so compare the sell-back price with the rental price before you decide. An eTextbook arrives instantly but usually expires. Rentals and used copies rarely include working access codes.
Always match the ISBN on your syllabus (9780132847377) before you order; different editions have different ISBNs.
About This Book
Data Structures and Algorithm Analysis in C++ is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language. This book explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm.