Analysis
Binary search
- storage: n pointers + words = 360KB
- time: log2n ? 15 probes per access, worst case
Open hashing
- storage: n + n/? pointers + words (? = 1 ? 600KB)
- time: 1 + ?/2 probes per access on average (? = 1 ? 1.5)
Closed hashing
- storage: n/? pointers + words (? = 0.5 ? 480KB)
- time: probes per access on average (? = 0.5 ? 1.5)