知识点梳理:数据结构与算法——检索
线性表的检索
二分检索
mid-1/mid+1
成功的平均检索长度:
(画出树来,第i层的元素经过i次检索到)
ASL = 1 n ( ∑ i = 1 j i ⋅ 2 i − 1 ) = n + 1 n log 2 ( n + 1 ) − 1 ≈ log 2 ( n + 1 ) − 1 \begin{aligned} \operatorname{ASL} &=\frac{1}{n}\left(\sum_{i=1}^{j} i \cdot 2^{i-1}\right) \\ &=\frac{n+1}{n} \log _{2}(n+1)-1 \\ & \approx \log _{2}(n+1)-1 \end{aligned} ASL=n