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

Given the following hash table, use hash function hashFunction and handle collisions using Linear Probing.

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); }

Linear probing is the simple one.

First use the hash function to computer the home slot.

If there is a collsion, then just step to the right by one step at a time until an empty slot is found.

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