Vous voulez voir cette page en fran�ais ? Cliquez ici.

More Buying Choices

Have one to sell? Sell yours here

Data Structures and Algorithm Analysis [Hardcover]

Mark Allen Weiss (Author)

2.0 out of 5 stars See all reviews (1 customer review)

Price:	CDN$ 123.50 & this item ships for FREE with Super Saver Shipping. Details
	o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

In Stock.
Ships from and sold by Amazon.ca. Gift-wrap available.

Only 1 left in stock--order soon.

Want it delivered Tuesday, May 29? Choose One-Day Shipping at checkout.

	Amazon Price	New from	Used from
Hardcover	CDN $123.50	--	--
See # more hardcovers

Product Details

Hardcover: 500 pages
Publisher: Addison Wesley; 2 edition (Sep 27 1994)
Language: English
ISBN-10: 080539057X
ISBN-13: 978-0805390575
Product Dimensions: 24.3 x 19.7 x 2.4 cm
Shipping Weight: 962 g

Average Customer Review: 2.0 out of 5 stars See all reviews (1 customer review)

Amazon Bestsellers Rank: #1,528,730 in Books (See Top 100 in Books)
- #92 in Books > Computers & Internet > Programming > Algorithms > Data Structures

Would you like to update product info or give feedback on images?

See Complete Table of Contents

Product Description

Book Description

This revision of Weiss' best-seller provides a concise, complete and dynamic picture of many important data structures used in modern programming practice using Pascal. The new edition retains its focus on issues of performance and efficiency, with the emphasis on concepts rather than code.
Features and Benefits

Many new and innovative data structures have been added including Tries/patricia, k-d trees, min max heaps, red black trees and pairing heap.
Many diagrams and illustrations added to aid the reader's understanding of data structures.

From the Back Cover

080539057XB04062001

See all Product Description

Inside This Book (Learn More)

First Sentence
Suppose you have a group of N numbers and would like to determine the kth largest. Read the first page

Explore More
Concordance

Tag this product

(What's this?)

Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.

Customer Reviews

1 Review

5 star:		(0)
4 star:		(0)
3 star:		(0)
2 star:		(1)
1 star:		(0)

Average Customer Review

2.0 out of 5 stars (1 customer review)

Share your thoughts with other customers:

Create your own review

Most helpful customer reviews

2.0 out of 5 stars Warning, Nov 2 2000

By A Customer

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

This book is not meant for the beginner and intermediate programer. The author intended this book for the elite. Don't buy this book if you don't have a background in Discrete Math or have Master the c language. Wouldn't not recommend this book to colleges who have a Data Structures class for undergraduates. The code in the book assumes that you can piece together the individual functions to write a full program in c. Also There is no problems that a student can try on his/her own and then find the answer in back of book.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

Share your thoughts with other customers: Create your own review

› See the customer review...

Most Helpful Customer Reviews on Amazon.com ^(beta)

Amazon.com: 2.8 out of 5 stars (4 customer reviews)

3 of 3 people found the following review helpful

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

By A Customer - Published on Amazon.com

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

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.

2 of 3 people found the following review helpful

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

By Pen Name "whiteaura" - Published on Amazon.com

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

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.

0 of 2 people found the following review helpful

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

By Raymond W. Champion III - Published on Amazon.com

This review is from: Data Structures and Algorithm Analysis (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.

› Go to Amazon.com to see all 4 reviews 2.8 out of 5 stars