#datastructures #algorithmanalysis #hashtable
*Summary*
This video covers how open addressing handles collisions in hashtables, and the implementation of hashtable operations, and the time complexity analysis on these operations.
If you haven’t seen Hashtable Deep Dive #1, watch it here:
https://youtu.be/Z43QoUzU5uE.
In the next video, we discuss a different approach to handle collisions, the chaining method. Watch it here:
https://youtu.be/3BKp1l8WYhc.
*Timestamp*
00:00 Overview
00:30 What collisions are
1:00 What open addressing is
4:08 Hashtable implementation
9:26 Time complexity analysis
16:30 Summary