假定有k个关键码互为同义词 即hash函数结果相同 若采用闭散列的线性探测法把这k个关键字存入散列
已帮助 人
假定有k个关键码互为同义词，即hash函数结果相同，若采用闭散列的线性探测法把这k个关键字存入散列表中，至少要进行（）次探测？ If there are k key values which are synonyms of each other, which means their return values of hash function are same, if we insert these k key values into the hash table by linear probing of closed hashing, we need to probe at least （) times.
A．k
B．k-1
C．k*(k+1)/2
D．k+1
回答
共1条回复-
k*(k+1)/2