Average case O(1) for insert, lookup, and delete thanks to hashing. Worst case O(n) when many keys collide into one bucket (degenerate hashing). A good hash function and load-factor-based resizing keep operations near O(1).
Data Structures· asked at Amazon✓ Added to review
💬
Send Feedback / Bug
Feedback Submitted!
Thank you. Your help keeps Geeky Script running smoothly.