Data Structures and Algorithm Analysis in Java

Data Structures and Algorithm Analysis in Java

by Mark Allen Weiss
     
 

Mark Allen Weiss provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool. With Java he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes this text with a logical organization of

Overview

Mark Allen Weiss provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool. With Java he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes this text with a logical organization of topics, his engaging writing style, and an extensive use of figures and examples showing the successive stages of an algorithm.

Features:

  • Contains extensive sample code using Java 1.2, which is available over the Internet.
  • Covers the Java Collections Library in an appendix.
  • Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide-and-conquer algorithms, dynamic programming, randomized algorithms, and backtracking.
  • Presents current topics and new data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees.
  • Offers a chapter on amortized analysis that examines the advanced data structures presented earlier in the book.
  • Provides a chapter on advanced data structures and their implementation, covering red-black trees, top-down splay trees, treaps, k-d trees, pairing heaps, and more.

Editorial Reviews

Booknews
This textbook for either an advanced data structures course or a first-year graduate course in algorithm analysis describes data structures--methods of organizing large amounts of data--and algorithm analysis--the estimation of the running time of algorithms. Weiss (computer science, Florida International U.) includes chapters on trees, hash tables, priority queues, sorting, the disjoint set algorithm, graph algorithms, algorithm design techniques, amortized analysis, and search tree algorithms, the k-d tree and the pairing heap. Annotation c. by Book News, Inc., Portland, Or.

Product Details

ISBN-13:
9780201357547
Publisher:
Addison Wesley
Publication date:
10/20/1998
Edition description:
Older Edition
Pages:
576
Product dimensions:
7.20(w) x 9.20(h) x 1.30(d)

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >