Data Structures and Algorithm Analysis (Hardcover)

by Mark Allen Weiss (Author) "Suppose you have a group of N numbers and would like to determine the kth largest..." (more)
Key Phrases: Information Processing Letters, New York, The Art of Computer Programming (more...)

Editorial Reviews

Product Description
Author continues to refine and enhance his innovative approach to algorithms and data structures. Offers source code from example programs via anonymous FTP. DLC: Data structures (Computer science) --This text refers to an out of print or unavailable edition of this title.

From the Back Cover


080539057XB04062001 --This text refers to an out of print or unavailable edition of this title.

See all Editorial Reviews

Product Details

• Hardcover: 500 pages
• Publisher: Benjamin-Cummings Pub Co (September 1991)
• Language: English
• ISBN-10: 0805390529
• ISBN-13: 978-0805390520
• Product Dimensions: 9.5 x 7.8 x 0.8 inches
• Shipping Weight: 1.8 pounds
• Average Customer Review: 2.8 out of 5 stars See all reviews (4 customer reviews)
• Amazon.com Sales Rank: #446,897 in Books (See Bestsellers in Books)

  Popular in this category: (What's this?)

  #33 in

  Books > Computers & Internet > Programming > Algorithms > Data Structures

Customer Reviews

Most Helpful Customer Reviews

3 of 3 people found the following review helpful:

4.0 out of 5 stars Data Structures and Algorithm Analysis, March 28, 2000

By A Customer

this book provides a concise and fundamental look into algorithms. Excellent book if you want to learn performance time and running time on your written code and gives you the technique to speed up your code. It does not focus too much on what kind of programming language you use and it is to be read in a general sense.

1.0 out of 5 stars Not for the faint of heart, January 18, 2007

By	Raymond W. Champion III (San Antonio, TX) - See all my reviews (REAL NAME)

This review is from: Data Structures and Algorithm Analysis (2nd Edition) (Hardcover)

I took a data strutures course that used this book. First you have to know C, not C++. You will be dealing with structs not classes. Know your pointers very well. The algorithms are covered are the general ones found in most textbooks dealing with algorithm analysis, but the examples provided are not complete and very vague. You have to rely completely on your instructor to spoon feed you the explanation and if your instructor sucks, then you are out of luck. There are much better textbooks, that take the time to give full explanations of the various interesting data structures out there. God bless and good luck to you if you are using this one for a DS course.

4.0 out of 5 stars Great for intermediate programmers, May 21, 2005

By	Pen Name "whiteaura" (milpitas, ca USA) - See all my reviews

I gave four stars because the author did a very good job of explaining algorithms. For example, he did a fantastic job of explaining the conversion of Infix Notation to Postfix Notation. Very nice to see a graphical step-by-step approach. Another good area was his break down of explaining how to derive the solution from a postfix equation. Again, nice usage of illustration step-by-step. I did not understand other author's datastructure book, but I did understand this one. I picked up this book only to learn Polish calculators (postfix/infix). Therefore, I did not read the other chapters. If the remaining chapters are as easily understandable as these two chapters, then I'll give 5 stars.