Enter your mobile number 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.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

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

Algorithms + Data Structures = Programs (Prentice-Hall Series in Automatic Computation) 1st Edition

4.7 out of 5 stars 16 customer reviews
ISBN-13: 978-0130224187
ISBN-10: 0130224189
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.
Have one to sell? Sell on Amazon
Buy used
$24.99
Condition: Used - Good
Condition: Used: Good
Comment: Nice previously handled copy with normal wear to covers, interior and exterior of book. May include notes, highlights, markings, negligible stains, etc. Good used copy.
Access codes and supplements are not guaranteed with used items.
31 Used from $6.84
FREE Shipping on orders over $25.
More Buying Choices
9 New from $57.78 31 Used from $6.84
Free Two-Day Shipping for College Students with Prime Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


The Amazon Book Review
The Amazon Book Review
Author interviews, book reviews, editors picks, and more. Read it now
click to open popover
NO_CONTENT_IN_FEATURE

New York Times best sellers
Browse the New York Times best sellers in popular categories like Fiction, Nonfiction, Picture Books and more. See more

Product Details

  • Series: Prentice-Hall Series in Automatic Computation
  • Hardcover: 366 pages
  • Publisher: Prentice Hall; 1st edition (February 1976)
  • Language: English
  • ISBN-10: 0130224189
  • ISBN-13: 978-0130224187
  • Product Dimensions: 0.8 x 6.5 x 9.5 inches
  • Shipping Weight: 1.2 pounds
  • Average Customer Review: 4.7 out of 5 stars  See all reviews (16 customer reviews)
  • Amazon Best Sellers Rank: #257,787 in Books (See Top 100 in Books)

Customer Reviews

Top Customer Reviews

By Fernando Berzal Galiano on March 17, 2006
Format: Hardcover
It might seem completely dated with all its examples written in the now outmoded Pascal programming language (well, unless you are one of those Delphi zealot trying to resist to the Java/.NET dominance), but it is still highly recommended.

It is the single book I learnt most from when I was a freshman studying Computer Science at my local University (when Pascal was already declining, I'm not so old ;-). I wish more recent books were as good as this one, but I have not found a single book so focused and, at the same time, so broad in scope as this one.

Wirth covers programming fundamentals (including recursion), many sorting algorithms, data structures (from simple data collections to B-trees and hashing), and basic compiler technology. That is, four books into one (and, surprisingly, this is not a hefty tome.)
Comment 31 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 is the book every beginning programmer must read. Modern programmers know a lot about specific technical details, but they know nothing about effective algorithms. We're hiring new programmers now. We've tested a lot of folks with 5-8 years experience in Java. The result is nobody can implement basic operations with B-tree or combinatory algorithm. It's terrible. So read Niklaus Wirth if you want to be a serious programmer.
Comment 26 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
With only five chapters and 365 pp, this text presents fundamental data structures, sorting, the best treatise I've found on recursion, dynamic information structures, and language structures & compilers. The date of the text precludes object-oriented programming, yet the tools presented here are welcome adjuncts for Delphi developers.
Comment 21 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 short size of this book reflects the good taste of its author. Rather than an encyclopedia, Wirth created a minimal set of data structures and algorithms that manage to provide an efficient solution for virtually every relevant problem, even today. The provided code is also very compact, again reflecting good taste and much polishing. Few blocks of code are longer than half a page, most are less than that, and I don't think there is a single block that goes for two whole pages. The concise blocks make it easy to hold the whole procedure in your head and understand it.

The language chosen, Oberon, was never popular. But simply translating keywords and operators turns the book's code into almost valid C, Java or (probably most easily) Delphi. After all, the syntax of all these languages has a common ancestor, Algol.

The author has made this book publicly available in PDF form at the ETH Oberon Home Page.
2 Comments 10 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
By A Customer on May 28, 1999
Format: Hardcover
With technologies moving faster than the speed of thought, people... especially youngsters work hard to keep up with fast moving specifications, versions of languages etc. and ignore basic programming logic... depth in programming.
This is one of those books that is ideally suited for youngsters who want to become good programmers who are not only technically sound, but have programming DEPTH, which is very important.
Comment 15 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
I bought this book back in 1982 and still refer to it for my current (Delphi) projects. It is a must for any programmer - beginner or professional who wants to write efficient algorithms.
Comment 8 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
I used this book back in university and still apply its techniques today. Unfortunately, someone *borrowed* my copy and I can't get hold of a new one, so: !!!Please reprint!!!!
1 Comment 11 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
By A Customer on July 7, 2004
Format: Hardcover
This book should be on the shelves of every computer science enthusiast and it does not hurt to read it once in a while to reestablish the foundations.
Comment 11 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