1. 二分法在升序数组中查找元素出现的位置(不存在则返回-1):
int binary_find(int *p, const int& target, const int& N)
{
if(N <= 0 || !p)
{
return -1;
}
int beg(0), end(N - 1), mid(0);
while(beg < end)
{
mid = beg + ((end - beg) >> 1);
if(p[mid] == target)
{
return mid;
}
if(p[mid] > target)
{
end = mid - 1;
}
else
{
beg = mid + 1;
}
}
return -1;
}
2.升序数组中查找元素第一次出现的位置(不存在则返回-1):
int search_first(int *p, const int& target, const int& N)
{
if(N <= 0 || !p)
{
return -1;
}
int beg(0), end(N - 1), mid(0);
while(beg < end)
{
mid = beg + ((end - beg) >> 1);
if(p[mid] == target)
{
end = mid;
}
else if(p[mid] > target)
{
end = mid - 1;
}
else
{
beg = mid + 1;
}
}
return p[beg] == target ? beg : -1;
}
3. 升序数组中查找元素最后一次出现的位置(不存在则返回-1):
int search_last(int *p, const int& target, const int& N)
{
if(N <= 0 || !p)
{
return -1;
}
int beg(0), end(N - 1), mid(0);
while(beg < end)
{
mid = end - ((end - beg) >> 1);
if(p[mid] == target)
{
beg = mid;
}
else if(p[mid] > target)
{
end = mid - 1;
}
else
{
beg = mid + 1;
}
}
return p[end] == target ? end : -1;
}
4. 升序数组中查找最后一个小于target的元素位置(不存在则返回-1):
int search_before(int *p, const int& target, const int& N)
{
if(N <= 0 || !p)
{
return -1;
}
int beg(0), end(N - 1), mid(0);
while(beg < end - 1)
{
mid = beg + ((end - beg) >> 1);
if(p[mid] >= target)
{
end = mid;
}
else
{
beg = mid;
}
}
return p[end] < target ? end : (p[beg] < target ? beg : -1);
}
int search_after(int *p, const int& target, const int& N)
{
if(N <= 0 || !p)
{
return -1;
}
int beg(0), end(N - 1), mid(0);
while(beg < end - 1)
{
mid = beg + ((end - beg) >> 1);
if(p[mid] <= target)
{
beg = mid;
}
else
{
end = mid;
}
}
return p[beg] > target ? beg : (p[end] > target ? end : N);
}