若砚的博客

二分查找和插值查找都是基于减而治之的原理1）细节：二分查找的范围的下标：lo和hi代表[lo,hi),因此，选择mid的时候,两部分是[lo,mid),和[mid+1,hi); 插值查找的含义类似于在字典中确定一个字母的范围，比如选择b的话，会在较前的页码处查找，这里，字母相当于数组的下标， 而页码相当于要查找的元素；2）效率：查找对数值的规模进行折半，因此二分查找的时间复杂度为log

Symbol tables are used to store key-value pairs. In common arrays, we just take keys as the order index from 0 to n, and we save value.Symbol tables used for searching by their keys not their values

public class CyclicQ3{ static int[] queue = new int[9]; static int front = 0; static int rear = 0; static void insert(int key) { if ((rear + 1) % 9 == front) { queue[rear % 9] = key;