Quadratic probing

Hide text Hide pseudo-code
Perform the following operations for the Hash table below:
  • add - insert new item
  • remove - delete an item
  • search - search an item

Your task is to show which table positions are visited during each operation.

The hash function is hi(k) = (k+i2) mod 19, where k is the key and i=0,1,2,.. is the number of attempts.

  Created Fri Oct 30 13:52:50 EET 2009 - Powered by SVG-hut