@kevinn
Computer Science · Georgia Tech · Class of 2027
Joined October 2025
My notes comparing open addressing strategies. h is the hash index, i is the attempt number. Linear: (h + i) mod capacity. Simple, but suffers from primary clustering. Quadratic: (h + i²) mod capacity. Avoids primary clustering but can fail to find an open spo…
My own pseudocode notes for rotations. Writing them this way stopped my pointer bugs. rotateLeft(node): newRoot = node.right node.right = newRoot.left newRoot.left = node update height and balance factor of node, then newRoot return newRoot rotateRight is the…