Its computational algorithm and process flowcharts are given, with average searching length within 1.39(1 + 1/N) and the extra memory cost N + 1 when data arin equidistribution.

• 对该算法进行分析的结果表明:在被检索数据均匀分布的情况下；分档检索法的平均检索长度不超过1.；39(1+(1/N))；附加存贮开销为N+1。