![Data Structures & Algorithm Analysis in C++](https://d3525k1ryd2155.cloudfront.net/f/377/847/9780132847377.PP.0.l.jpg)
Stock Photo: Cover May Be Different
Data Structures & Algorithm Analysis in C++ Hardcover - 2013
by Weiss, Mark
- Used
- Good
- Hardcover
Description
NZ$149.62
NZ$8.29
Shipping to USA
Standard delivery: 7 to 14 days
More Shipping Options
Standard delivery: 7 to 14 days
Ships from TxtBroker (Tennessee, United States)
Details
- Title Data Structures & Algorithm Analysis in C++
- Author Weiss, Mark
- Binding Hardcover
- Edition 4th
- Condition Used - Good
- Pages 664
- Volumes 1
- Language ENG
- Publisher Pearson, U.S.A
- Date 2013-06-13
- Illustrated Yes
- Features Illustrated, Index, Table of Contents, Textbook
- Bookseller's Inventory # mon0000067749
- ISBN 9780132847377 / 013284737X
- Weight 2.3 lbs (1.04 kg)
- Dimensions 9.2 x 7.6 x 1.1 in (23.37 x 19.30 x 2.79 cm)
- Library of Congress subjects Data structures (Computer science), C++ (Computer program language)
- Library of Congress Catalog Number 2013011064
- Dewey Decimal Code 005.73
About TxtBroker Tennessee, United States
Biblio member since 2017
TxtBroker offers it's customers textbooks at discounted prices. We have multiple locations throughout the U.S. and strive for excellent customer service. Please email customerservice@textbookbrokers.com for all inquiries.
If you pay for expedited shipping, you can expect an order from us to reach you in 2-3 business days after shipment. A standard shipping order will usually reach you in 7-21 business days, although it can take up to a month in some cases.
Summary
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.