Khan.randRange(5, 8) openHashPRO.initJSAV(arr_size)

On the left is an array of numbers that are to be inserted (in order, from top to bottom) into the hash table on the right. The hash table uses open hashing to deal with collisions.

Move each record on the left to the appropriate bin on the right when using the simple mod hash function.

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

This is easy. For each item in the left array, going from top to bottom ...

... click on that item, compute modulo 10, and click on the corresponding bin in the right array.