单选题:Given a hash table of size 13 and the hash function $$h(x)=x \%
Given a hash table of size 13 and the hash function $$h(x)=x \% 13$$. Assume that quadratic probing is used to solve collisions. After filling in the hash table one by one with input sequence { 10, 23, 1, 36, 19, 5 }, which number is placed in the position of index 0?
@[D](3)
A. 23
B. 36
C. 10
D. none
A.23
B.36
C.10
D.none
答案:D
@[D](3)
A. 23
B. 36
C. 10
D. none
A.23
B.36
C.10
D.none
答案:D