Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Data Structures and Algorithm Analysis in C++ (3rd Edition) 3rd Edition

3.4 out of 5 stars 23 customer reviews
ISBN-13: 978-0321441461
ISBN-10: 032144146X
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Trade in your item
Get a $2.46
Gift Card.
Have one to sell? Sell on Amazon
Rent On clicking this link, a new layer will be open
$14.03 On clicking this link, a new layer will be open
Buy used On clicking this link, a new layer will be open
$24.20 On clicking this link, a new layer will be open
More Buying Choices
15 New from $49.75 41 Used from $14.98

There is a newer edition of this item:

Free Two-Day Shipping for College Students with Prime Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


The Numberlys Best Books of the Year So Far
click to open popover

Editorial Reviews

From the Back Cover

Advanced Data Structures/Algorithms C++

 

Data Structures and Algorithm Analysis in C++, 3/e

Mark Allen Weiss, Florida International University

ISBN : 0-321-37531-9

 

Mark Allen Weiss teaches readers to reduce time constraints and develop programs efficiently by analyzing an algorithm’s feasibility before it is coded. His innovative approach to advanced algorithms and data structures simultaneously develops sound algorithm analysis and programming skills.

 

The Third Edition features a full C++ language update and incorporation of the Standard Template Library. There is new treatment of lists, stacks, queues, and trees, and an entire chapter dedicated to amortized analysis and advanced data structures such as the Fibonacci heap.

 

Highlights of the Third Edition

• All code has been updated and tested to ensure compliance with the ANSI/ISO C++ standards

 

• Standard Template Library fully incorporated throughout the text

 

• Completely revised coverage of lists, stacks, and queues in Chapter 3

 

• Readability enhanced by fresh interior design with new figures and examples

 

• End-of-chapter exercises, ranked by difficulty, reinforce key chapter concepts

 

 

Visit aw.com/computing for more information about Addison-Wesley computing books.
NO_CONTENT_IN_FEATURE

The latest book club pick from Oprah
"The Underground Railroad" by Colson Whitehead is a magnificent novel chronicling a young slave's adventures as she makes a desperate bid for freedom in the antebellum South. See more

Product Details

  • Hardcover: 586 pages
  • Publisher: Pearson; 3 edition (March 10, 2006)
  • Language: English
  • ISBN-10: 032144146X
  • ISBN-13: 978-0321441461
  • Product Dimensions: 7.6 x 1 x 9.3 inches
  • Shipping Weight: 2.4 pounds
  • Average Customer Review: 3.4 out of 5 stars  See all reviews (23 customer reviews)
  • Amazon Best Sellers Rank: #153,530 in Books (See Top 100 in Books)

Customer Reviews

Top Customer Reviews

Format: Hardcover Verified Purchase
If you can understand all the examples in this book, then you're name is Mark Allen Weiss. You will need other references unless you have a good instructor that can explain it to you. Are there better books on Algorithms available? Not that I have found. The code that Weiss has available from his website may or may not be complete. For example, the Vector class is missing line 71 "int numToCopy = newCapacity < theSize ? newCapacity : theSize;".

Weiss is releasing a new version of this in fall of 2011.

A good supplement to go along with this book is Clifford Shaffer's "A Practical Introduction to Data Structures and Algorithm Analysis: Third Edition". Shaffer offers his book for free on his website at Virginia Tech.

"Introduction to Algorithms, Third Edition" by Cormen, Leiserson, Rivest and Stein is good.
1 Comment 14 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
This book was the required text book for my 3rd computer science course. The previous two courses used the book, C++ Programming: Program Design Including Data Structures by Malik. I used to read that book every night because I enjoyed it so much. But not this book!

Reading this book is like talking to those kind of people who intentionally talk over your head just to prove how smart they are. The examples are terrible, and more emphasis is put on runtime cost than actually explaining the algorithm. I understand it's a book about algorithm analysis, but I do expect the algorithm to be explained before its cost is analyzed.

I'm pretty sure the author could make tying a shoe seem like the most daunting task in the world.
Comment 13 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
This is the biggest problem with the text book (from the author's web site at [...])

"This is the only way to get solutions. I do not have any copies of solutions manuals. As a matter of policy, I cannot provide answers to questions in the text, because it is impossible for me to determine if I would be doing somebody's homework. Thus, I must decline to answer the growing number of emails that request such assistance. "

Mr. Weiss, I respectfully disagree. While it is not your job to *do* someone's homework, it is your job to help them find their way. Certainly, not via email. But there's an implied contract when the book is purchased that there will be sufficient methods of gaining proficiency. Aside from trying to write the data structures on your own, there is no other way. The questions are pointless if the only way to get a solution manual is to be an instructor and buy it from the publisher's sales rep, you're cheating the student out of what you were paid to do! Take the time to create more questions, supply only the even or odd answers, but for God's sake have mercy upon the souls of the students stuck for 16 weeks with your book!

With that out of the way, and assuming that you're a motivated student who digs computers, this book isn't bad at all. There are some notable problems as indicated in other reviews. The path to examples can be poorly laid out, and the source code can be confusing. And at times, the book can lean into confusing the reader to the point of making them give up.

An example of this is on page 161 discussing B-Trees and sizing M and L. Mr. Weiss gives a run down of how to select these variables for the B-Tree, using sentences such as "32M-32 bytes".
Read more ›
Comment 13 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
the explanations in the book are very unclear. he does not give enough example and when he does, he does not really explain the example. verbose explanations with very little substance. the funny thing is that i already knew and understood most of the data structures in this book because my previous class had cover most of the it. even with that knowledge, i still found this book unclear and useless. i ended up using the book i used for my previous class instead, which is called "Data Abstraction & Problem Solving with C++ (5th Edition) ". it is a much better book. however, there are more advanced topics in this book that my previous book did not cover, so for those topics, i ended up using youtube and the internet to help me understand because this book sucks and my professor is equally horrible. THIS BOOK IS USELESS, the only i got this book was for class.
Comment 7 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
The coding style is fairly outdated and heavily abstracted.
Simple code examples use C++ vectors when all that's necessary is an array.

The professor for my class wrote a 100 page supplement because this textbook lacked the information our class needed to cover the material for the course.

I'm selling trading this in once the quarter ends, what a waste.
2 Comments 3 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
The person who wrote this book thinks he's the worlds smartest man. He assumes you know everything, and thus makes steps in examples with no explanation beyond "obviously the next step is...". I would not recommend this book to anyone.
1 Comment 14 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
I had to get this book for a algorithms course and it was a complete waste of money. There was nothing (to my knowledge) in this book that you couldn't find on the internet for free. It had some interesting exercises but for the price I would expect much more
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
I bought this book for my 3rd computer science class and I recommend that you avoid this book if possible.

First off, what the other reviews said is true...he talks like you already understand everything and doesn't make his examples clear. It is hard to understand the examples if you are just beginning in more advanced algorithms and algorithm analysis.

Another thing that bothers me about this book is that the code is near impossible to read. He doesn't follow good coding practice by making his code readable! His coding style can also be a bit obscure at times. This is a textbook, shouldn't the code be readable? I got really tired of all his unnamed variables (i , j , and k are his favorite). You have to reread several times the explanation of the code just to remember what the variables mean. Then to top it all off, some of the code doesn't work properly or is incomplete. I tried using some of his code and it doesn't work properly. The quicksort algorithm in the book does not run in O(n * log n) time.

So if at all possible, if you are trying to find an easy to understand book or are fairly new to computer science, or just want a good computer science textbook, I would strongly suggest that you find another book. If you enjoy the nitty gritty of the math of algorithm analysis and are already experienced in computer science then you might enjoy this book. I certainly wished our university would choose a more helpful book.
Comment 3 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Most Recent Customer Reviews