A Practical Introduction to Data Structures and Algorithm Analysis
Clifford A. Shaffer provides a treatment of fundamental data structures and the principles of algorithm analysis understandable by sophomore and junior level students in Computer Science and related fields. The author focuses on teaching students and practitioners to understand the principles required to select or design the data structure that will best solve his/her problem.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Data Structures and Algorithms
15 other sections not shown
Other editions - View all
amortized analysis array array-based list Assume B-tree binary search binary tree block bool buffer pool bytes called const Constructor contains cost curr data structure database delete disk drive doubly linked list edge efficient ELEM ELEM& element example freelist graph hash function hash table heap home position Huffman coding induction input Insertion Sort integer internal nodes k-d tree key value leaf node link node linked list list class list implementation list node listarray loop main memory matrix memory manager merge Mergesort nodes store NULL operations output pointer PR quadtree probe sequence problem quadtree queue Quicksort Radix Sort records recursive requires right child right subtree root running Section sector self-organizing list simple Skip List slot solve sorting algorithm space Splay Tree stack string sublists swap takes temp theorem traversal VarBinNode variable vertex vertices void