Data Structure Properties

Designing Algorithms
(divide and conquer et al.)
- Sorting (linear sort, nlogn comp. sort)
- Divide and Conquer (split into sub probs)
- Hashing (finding collisions)
- Frequency tables (Direct access array)
- 2 fingers (window sliding)
- Data structures: AVL, Heaps, Hash tables
- Observe patterns
 Designing Algorithms using
Data Structures
Creating a data structure that satisfies some API and
runtime requirements
Sorting