Programming Books C Java PHP Python Learn more Browse Programming Books
Buy Used
$18.29
FREE Shipping on orders over $35.
Condition: Used: Good
Comment: Eligible for FREE Super Saving Shipping! Fast Amazon shipping plus a hassle free return policy mean your satisfaction is guaranteed! Good readable copy. Worn edges and covers and may have small creases. Otherwise item is in good condition.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Algorithms and Data Structures Hardcover – November 1, 1985


See all 2 formats and editions Hide other formats and editions
Amazon Price New from Used from
Hardcover
"Please retry"
$70.24 $4.14
Paperback
"Please retry"
NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

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: #1,369,710 in Books (See Top 100 in Books)

More About the Author

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

Customer Reviews

3.8 out of 5 stars
Share your thoughts with other customers

Most Helpful Customer Reviews

6 of 6 people found the following review helpful By "oversteer" on December 2, 2002
Format: 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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
5 of 5 people found the following review helpful By John Lacey on March 2, 2002
Format: 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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
2 of 4 people found the following review helpful By Francisco on April 1, 1998
Format: 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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
9 of 18 people found the following review helpful By Alen Lovrencic on May 28, 2001
Format: Hardcover
This is an old book. I have it for 15 years.
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again