Data Structures and Algorithm Analysis in C++

by Mark Allen Weiss

In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from several years to less than a second. Class templates are used to describe generic data structures and first-class versions of vector and string classes are used. Included is an appendix on a Standard Template Library (STL). This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.

Genres: Computer Science, Algorithms, Programming, Reference, Textbooks, Nonfiction, Technical

586 pages, Hardcover

First published December 1, 1993

Reviews

[Kaung Si Thu · Rating 4 out of 5]

A good book to start with. Although some improvements can be made in implementation codes, it is more than enough to understand the topic (We all know that coding does not say almost anything about computer science; it is just standard introductory step for computer science.)

[Ahmed · Rating 5 out of 5]

It was really good study material for data structure and a simple intro to some algorithms it focused more on the theoretical part than the coding one, which might seem intense.
but overall really helpful book

[Eric F. · Rating 5 out of 5]

Nerd candy.

[Irfan]

good

[Jeremy Carman · Rating 3 out of 5]

While I think the author did well at explaining what each algorithm was. The errors in code examples, and some of the overly generic language made this a hard read.

[Jeffery Kriske Jr · Rating 5 out of 5]

Excellent examples!

[Kailin Zen · Rating 4 out of 5]

I enjoyed this book, and thought the examples were thoughtfully selected. But there were several points in the book where there were clear errors in the provided implementation code. I'm using the 4th edition for the textbook, so I don't understand why there are still so many mistakes.

Also, the author’s language is oddly florid for a computer science textbook. The classic Algorithms textbook by Cormen/Leiserson/Rivest/Stein is a lot more clearly written, and I found myself referring back to that text for better explanations of certain concepts.

[Ibrahim Radi · Rating 4 out of 5]

I think that this is a great book for anyone starting to learn about data structures and algorithms. If you have some experience with any coding language, you should try this book.
It is to the point and not at all complex sparing the idea and concept that is being talked about. In the end the chapters on advanced algorithms are very good.
I've been reading this book in a Data Structure course at the university.

[Mehmet Davut · Rating 5 out of 5]

I liked the examples in the book, all of them were plausible problems that you can see around. And the references at the end of each chapters were nice, I like to check them and added some new books and articles to my list.

[Robin · Rating 4 out of 5]

Good content and well structured, but could have used some more interesting examples and suggested applications.

[Aryaman]

masterpiece

[Jordan! · Rating 4 out of 5]

Awful.

[Michael Venzke]

good book for beginners, mixes code and algorithms.

wikipedia probably provides the same information these days though.

[Heting Yan]

good

[Hoang]

good

[Kirill Igumenshchev · Rating 5 out of 5]

This book was my intro to algorithms and data-structures. I reproduced all of the code examples. After this book, I was ready for coding puzzles books and coding interviews.

If you want to code a fast language and don't have a formal cs degree, this is the most effective way to learn instead then reading books with pseudo-algorithms.