Lecture 011

• can we have "about" O(1) access and self-resizing?

Amortized Analysis

k increment when flipping bits: each time cost may vary. But overall k bits time only cost O(2), not O(kn).

• This is different from average complexity because it is deterministic (no lucky vs. unlucky)

Mythology

1. find out candidate amortized cost (pretend operation cost)

2. 

3. Specify Token Invariant (how many tokens need to be saved)

4. Prove operation preservation (induction)

5. saved_before = amortized_cost - actual_cost = saved_after

Implementation ArrayList (using Array)

struct uba_header {
 int size;
 int limit;
 string[] data;
}