Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Data Structures and Algorithm Analysis in Java

Mark Allen Weiss

3.6/5 ( ratings)

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.A full language update to Java 5.0 throughout the text--particularly its use of generics--adds immeasurable value to this advanced study of data structures and algorithms. This Second Edition features integrated coverage of the Java Collections Library as well as a complete revision of lists, stacks, queues, and trees.Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code compliment the text's coverage.

Language: English

Pages: 555

Format: Hardcover

Publisher: Addison Wesley Publishing Company

Release: February 21, 2006

ISBN: 0321370139

ISBN 13: 9780321370136

Data Structures and Algorithm Analysis in Java

Mark Allen Weiss

3.6/5 ( ratings)

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.A full language update to Java 5.0 throughout the text--particularly its use of generics--adds immeasurable value to this advanced study of data structures and algorithms. This Second Edition features integrated coverage of the Java Collections Library as well as a complete revision of lists, stacks, queues, and trees.Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code compliment the text's coverage.

Language: English

Pages: 555

Format: Hardcover

Publisher: Addison Wesley Publishing Company

Release: February 21, 2006

ISBN: 0321370139

ISBN 13: 9780321370136

More books from Mark Allen Weiss

Data Structures and Algorithm Analysis in C++

3.9/5 ( ratings)

Data Structures and Algorithm Analysis in C

3.8/5 ( ratings)

C++ for Java Programmers

3.6/5 ( ratings)

Data Structures and Problem Solving Using Java

3.7/5 ( ratings)

Data Structures and Problem Solving Using C++

3.7/5 ( ratings)

Efficient C Programming

3.9/5 ( ratings)

Data Structures and Algorithm Analysis

3.7/5 ( ratings)

Data Structure & Algorith Analy In C++

4.2/5 ( ratings)

Electrify Your Strings: The Mark Wood Improvisational Violin Method (Book & CD)

Data Structures and Problem Solving Using Java

Judas Priest: Hell Bent for Lead Licks: A Lead Guitarist's Guide to Judas Priest

Datastructures and Algorithm Analysis in C, 2/e

Data Structures and Algorithm Analysis in Ada

Rate this book!

Write a review?