Data Structures & Algorithm Analysis in Java
With its focus on creating efficient data structures and algorithms, this comprehensive text helps readers understand how to select or design the tools that will best solve specific problems. It uses Java as the programming language and is suitable for second-year data structure courses and computer science courses in algorithm analysis.
Techniques for representing data are presented within the context of assessing costs and benefits, promoting an understanding of the principles of algorithm analysis and the effects of a chosen physical medium. The text also explores tradeoff issues, familiarizes readers with the most commonly used data structures and their algorithms, and discusses matching appropriate data structures to applications. The author offers explicit coverage of design patterns encountered in the course of programming the book's basic data structures and algorithms. Numerous examples appear throughout the text.
What people are saying - Write a review
We haven't found any reviews in the usual places.
amortized analysis array array-based list Assume asymptotic average AVL tree B+-tree binary search binary tree block buffer pool bytes contains cost curr data structure database deleted disk drive edge efficient element example Figure freelist graph growth rate hash function hash table heap Huffman Huffman coding illustrates implementation induction input Insertion Sort integer internal nodes Java k-d tree key value leaf nodes linear linked list logn loop lower bound main memory matrix memory manager merge Mergesort method node’s NP-complete null operations output pair performance pointer polynomial PR quadtree probe sequence problem proof public int public void quadtree queue Quicksort Radix Sort requires result right child root running Section sector self-organizing list sequential search simple Skip List slot solution solve sorting algorithm space splay tree stack string sublists Theorem traversal typically vertex vertices worst