Slides / Video
Amortized Cost: Arrays & Hash Tables
Why doubling makes dynamic array append and hash insert O(1) amortized despite costly O(n) resizes.
1 / 6
Why doubling makes dynamic array append and hash insert O(1) amortized despite costly O(n) resizes.