Suppose you use a simple division hash function, h (k)=kn, and linear probing to insert a series of elements: 4,5,6,8,10
Posted: Fri Jun 10, 2022 11:55 am
Suppose you use a simple division hash function, h (k)=kn, and linear probing to insert a series of elements: 4,5,6,8,10, one by one to an array (Suppose the length of array: n=6). What would be the array position (or index) to store 10? A. 0 B. 1 C. 3 D. 4