Algorithms and Data Structures: Java Edition--Design, Correctness, Analysis (Paperback)

~ Jeffrey Kingston (Author), Brian Cole (Author)

Editorial Reviews

Product Description

Provides an in-depth treatment of the central algorithms and data structures of computer science and an introduction to the techniques of design, correctness, and analysis required for understanding them. Covers major applications such as lists, trees, sorting and disjoint sets. Paper. --This text refers to an alternate Paperback edition.

From the Back Cover

Features:

Consistent use of state-of-the-art techniques throughout, including object-oriented programming

Topics have been carefully selected to ensure that they are of real practical importance and presented in a logical sequence

Complete and carefully tested Eiffel implementations with many attractive examples, diagrams and exercises

0201360624B04062001

See all Editorial Reviews

Product Details

• Paperback: 400 pages
• Publisher: Addison Wesley; 2nd edition (May 1, 2002)
• Language: English
• ISBN-10: 0201360624
• ISBN-13: 978-0201360622
• Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
• Amazon.com Sales Rank: #7,392,709 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

2 of 9 people found the following review helpful:

4.0 out of 5 stars Advance, Useful, Helpful, November 22, 1998

By A Customer

This review is from: Algorithms and Data Structures: Design, Correctness, Analysis (2nd Edition) (Paperback)

If you are a computer science student or advance programmer, you should get this book. The diagrams and descriptions in the book give you insights of the advance programming which would help you. However you may get confused because the examples in the book is using the programming language Eiffel. You would like this book if and only if you like hard coding.