Khan.randRange(1, 999) Khan.randRange(0, 2) bucketCommon.initJSAV("HashBucketPRO", iKey, iSteps)

You are given a hash table of 5 buckets, each of size 2. Using the first bucket hash method described above, put key value iKey into the hash table.

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

Bucket hash first uses the hash function to select a bucket (the number of buckets serves as the hash table size).

If there is a collision, then linear probing is used to locate another slot within that bucket.

If the bucket is full, then put the record into the overflow.