- Hardcover: 400 pages
- Publisher: Prentice Hall (11 Nov 1975)
- Language English
- ISBN-10: 0130224189
- ISBN-13: 978-0130224187
- Product Dimensions: 23.1 x 15.7 x 3.3 cm
-
Amazon Bestsellers Rank:
33,018 in Books (See Top 100 in Books)
- #67 in Books > Science & Nature > Mathematics > Reference
| ||||||||||||||||||
 Trade In this Item for up to £3.60
Get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade in Algorithms Plus Data Structures Equals Programs (Prentice-Hall series in automatic computation) for an Amazon.co.uk gift card of up to £3.60, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
Product details |
More About the Author
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product)
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Reviews
There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
11 reviews
23 of 23 people found the following review helpful
A real gem...
17 Mar 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.)
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.)
19 of 19 people found the following review helpful
This is the book every programmer must read
22 July 1999
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.
16 of 16 people found the following review helpful
A Necessary Block of a Programmer's Foundation
18 Aug 2000
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.
Were these reviews helpful?
Let us know
Listmania!
|
|
Look for similar items by category
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
