Algorithms and Data Structures [Hardcover]

Niklaus Wirth (Author)

Book Description

Publication Date: November 1985

From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms Plus Data Structure Equals Programs (PH, l975). This title uses Modula-2 and includes new material on sequential structure, searching and priority search trees.

Product Details

• Hardcover: 288 pages
• Publisher: Prentice Hall (November 1985)
• Language: English
• ISBN-10: 0130220051
• ISBN-13: 978-0130220059
• Product Dimensions: 9.4 x 7.1 x 1 inches
• Shipping Weight: 1.5 pounds
• Average Customer Review: 3.8 out of 5 stars  See all reviews (4 customer reviews)
• Amazon Best Sellers Rank: #702,990 in Books (See Top 100 in Books)
  • #65 in Books > Computers & Technology > Programming > Algorithms > Data Structures

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

5 of 5 people found the following review helpful:

5.0 out of 5 stars A must read book in programming, December 2, 2002

By 

"oversteer" (Boston, MA USA) - See all my reviews

This review is from: Algorithms and Data Structures (Hardcover)

The book goes over practically important algorithms and data structures. It may not include the latest and greatest advances, but it is still very relevant in today's practical applications.

To me, the highest value of the book is not the particular methods explained, but the good style and the way of thinking about programs that the book teaches. There are very few books that can actually teach good style, and this is probably one of the best.

This book is a must read for anyone wishing to become a great programmer, not merely an average one. Another good book is "Design Patterns" by the gang of four, it is the next level.

4 of 4 people found the following review helpful:

5.0 out of 5 stars Short and sweet, March 2, 2002

By 

John Lacey (San Luis Obispo, CA United States) - See all my reviews
(REAL NAME)   

This review is from: Algorithms and Data Structures (Hardcover)

This isn't a voluminous compilation of algorithms or data structures, but for me it's the first place to look. If I can't find what I need here, I'll check more complete sources, typically either Introduction to Algorithms or Knuth. But if what I need is here, it's typically covered more succinctly and accessibly. It's been on my bookshelf for almost fifteen years, and I haven't seen a worthy, or necessary, replacement.

1 of 3 people found the following review helpful:

3.0 out of 5 stars Very good for my studying, April 1, 1998

By 

Francisco - See all my reviews

This review is from: Algorithms and Data Structures (Hardcover)

This is a good book. I use it everyday in my computer programming subject and this is so cool!!! My teacher takes examples and solve them from the book.