int q_search(int a[ ], int val, int low, int high) //val为要查找的数字,low为数组的最小下标,high为最大下标
{
int num, mid;
if (low >= high-1)
if (a[mid] == val)
return mid;
if (a[mid] > val)
num = qserch(a, val, low, mid);
if (a[mid] < val)
num = qserch(a, val, mid, high);
return num;
}
{
int num, mid;
if (low >= high-1)
return -1;
if (a[mid] == val)
return mid;
if (a[mid] > val)
num = qserch(a, val, low, mid);
if (a[mid] < val)
num = qserch(a, val, mid, high);
return num;
}