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

Given the following hash table, use hash function hashFunction and handle collisions using Linear Probing by Steps with probe function P(K, i) = probeCommon.probeStepi.

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 collsion, then just step to the right like normal linear probing, but step by the step size. For example, if the step size is 4, go 4 slots to the right.

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