有序数组的二分查找算法的时间复杂度位O(log(n)), 迭代算法较好实现,但是占用栈资源较多,如果是海量数据查找,则会引起栈溢出的问题。所以才有用非递归方式来实现。这里给出递归的方式,主要目的是理解其原理,从理论上便于分析时间和空间复杂度。
int BinarySearch(void *a, int low, int high, void * key)
{
int mid;
mid = (low + high)/2;
if (low >= high - 1)
{
if (a[low] == *key)
{
return low;
}
else if (a[high] == *key)
{
return high;
}
else
{
printf("can not find the item.\n");
return -1;
}
}
if (a[mid] == *key)
{
return mid;
}
else if (a[mid] < *key)
{
return search_iter(a, low, mid, key);
}
else
{
return search_iter(a, mid, high, key);
}
}
{
int mid;
mid = (low + high)/2;
if (low >= high - 1)
{
if (a[low] == *key)
{
return low;
}
else if (a[high] == *key)
{
return high;
}
else
{
printf("can not find the item.\n");
return -1;
}
}
if (a[mid] == *key)
{
return mid;
}
else if (a[mid] < *key)
{
return search_iter(a, low, mid, key);
}
else
{
return search_iter(a, mid, high, key);
}
}