- 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: #447,768 in Books (See Top 100 in Books)
Enter your mobile number or email address 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.
To get the free app, enter your email address or mobile phone number.
Algorithms and Data Structures Hardcover – November, 1985
Top 20 lists in Books
View the top 20 best sellers of all time, the most reviewed books of all time and some of our editors' favorite picks. Learn more
Customers Who Bought This Item Also Bought
More About the Author
Top Customer Reviews
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.
This book is second edition of the book Algorithms + Data Structures = Programming, without Compiler construction, so the formula for it can be
(Algorithm + Data Structures = Programming) - Compiler Construction = Algorithms & Data Structures.
I bought it because of its famous author, N. Wirth, the creator of Pascal, Modula and Oberon progarmming languages.
But the book was a dissapointment for me. The matter in the book is presented in very strange order. There are no field in the book that is explained complete. For example, there are many sorting algorithms in the book, internal as well as external, but some basic sorting algorithms and techniques are not explained. Quicksort algorithm is explained without explaining underlying devide-and-conquer method, etc.
If you considering to by some book from the field of compute algorithms and data structures, there are many better books to buy than this one.