Hash Tables Pseudocode

Operations using chaining collision resolution.

Insert (Chaining)

Pseudocode

1procedure INSERT(H, key, value)
2  i ← hash(key) mod size(H)
3  if H[i] is empty then
4    H[i] ← new list
5  end if
6  append (key, value) to H[i]
7end procedure

Pseudocode

1procedure SEARCH(H, key)
2  i ← hash(key) mod size(H)
3  for each (k, v) in H[i] do
4    if k = key then return v
5  end for
6  return NOT_FOUND
7end procedure

Delete

Pseudocode

1procedure DELETE(H, key)
2  i ← hash(key) mod size(H)
3  for each (k, v) in H[i] with index j do
4    if k = key then
5      remove H[i][j]
6      return
7    end if
8  end for
9end procedure

See theory and interactive practice from the Hash Tables page.