10 "h(k) = k mod " + arrSize probeCommon.initJSAV("HashPseudoRandomPPRO", arrSize)

Given the following hash table, use hash function hashFunction and handle collisions using pseudo-random probing. The random permutation to use is probeCommon.permutation.join(' ').

In which slot should the record with key value probeCommon.currentKey be inserted?

[probeCommon.userInput]
if (!probeCommon.checkAnswer(arrSize) && !guess[0]) { return ""; // User did not click, and correct answer is not // initial array state } else { return probeCommon.checkAnswer(arrSize); }

First use the hash function to computer the home slot.

If there is a collision, use the random permutation table to tell you how far to step from the home slot.

Offsets are always from the home slot, not from the last slot probed to.

If we reach the end of the array while stepping, then cycle around to the beginning.