Data Structures, Algorithms, and Performance
Consistently using a framework of abstract data types, this book describes all the important data structures and the algorithms that act upon them. The book has two underlying goals: to present the techniques necessary to analyze the performance of data structures and algorithms and to describe the methods used to determine the good and bad features of data structures.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Data Structures and Data Types
19 other sections not shown
array assume begin binary search tree binary tree BINTREE block bound bucket cell codeword comparisons compute corresponding data structures define denote dictionary digraph double hashing edge efficient element empty encoding example Exercise expected number expected-case external node Figure function value given graph hash function hash table height implementation integer internal IsMember key universe left subtree linear hashing linear probing load factor logarithmic merge MergeSort method move-to-front multiway search tree multiway tree node visits number of node number of probes obtain operations optimal tree parent Pascal path performance pointer representation position PRIORITY QUEUE priority tree problem Program query sequence records recursive red-black tree right subtree root Section separate chaining sequential search shown in Fig single promotion sorted order source trie spanning tree splay tree split string successor symbol takes tion topologically sorted totally ordered tree of Fig unsuccessful search updates vertex vertices window worst worst-case