CLRS 11.4開放定址法
阿新 • • 發佈:2019-01-28
11.4-1
只給出結果,如下:
11.4-2
HASH-DELETE(T,k)
i=0
repeat
j = h(k,i)
if ( T[j] == k )
T[j] = DELETED
return
i = i + 1
until T[j] == NIL or i == m
return
HASH-INSERT(T, k)
i = 0
repeat
j = h(k,i)
if ( T[j] == NIL or T [j] == DELETED )
T[j] = k
return j
else i = i + 1
until i == m
error "hash table overflow"
11.4-3
由定理11.6和11.8可得一次不成功查詢和一次成功查詢探查的期望上界分別是
11.4-4
在返回 /d
現設
因為
11.4-5
直接列出等式