//插值查找int InsertionSearch(int a[], int value, int low, int high){    int mid = low+(value-a[low])/(a[high]-a[low])*(high-low);    if(a[mid]==value)        return mid;    if(a[mid]>value)        return InsertionSearch(a, value, low, mid-1);    if(a[mid]