CLRS 11.4开放寻址法

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可得一次不成功查找和一次成功查找探查的期望上界分别是 $1/(1-\alpha),\frac 1\alpha \ln \frac{1}{1-\alpha}$，带入 $\alpha$得：
$\alpha=3/4$ 时不成功查找、成功查找上界分别是