单选题:Insert {18, 23, 11, 20, 2, 7, 27, 33, 42, 15} one by one into an
Insert {18, 23, 11, 20, 2, 7, 27, 33, 42, 15} one by one into an initially empty hash table of size 11 with the hash function H(Key)=Key%11, and quadratic probing is used to resolve collisions. How many numbers can be inserted without collisions? @[B](2)
A. 5
B. 6
C. 7
D. 8
A.5
B.6
C.7
D.8
答案:B
A. 5
B. 6
C. 7
D. 8
A.5
B.6
C.7
D.8
答案:B