What strategy for implementing sets attempts to approximate random access into an array for insertions, removals, and searches?
A) indexing
B) linking
C) hashing
D) keying

Question

Quizplus · Accepted Answer

Hashing is the strategy that attempts to approximate random access into an array for insertions, removals, and searches by using a hash function to compute an index into an array of buckets or slots, from which the desired value can be found.

What Strategy for Implementing Sets Attempts to Approximate Random Access