单选题：Suppose that the range of a hash table is [0, 16], and the hash

Suppose that the range of a hash table is [0, 16], and the hash function is H(Key)=Key%13. If linear probing is used to resolve collisions, then after inserting { 24, 12, 13, 49, 23 } one by one into the hash table, the index of 23 is: @[A](2)

A. 13
B. 0
C. 10
D. 1




A.13
B.0
C.10
D.1


答案：A