c语言二分查找泛型实现

int intCmp(const void *lhs, const void *rhs)
{
int a = *(int*)lhs;
int b = *(int*)rhs;

if (a > b)
return 1;
else if (a == b)
return 0;
else
return -1;
}

int bSearch(void *array, const void *elem, const int elemSize, const int arraySize, int (*cmp)(const void *lhs, const void *rhs))
{
int left = 0;
int right = arraySize - 1;
while (left <= right)
{
int mid = (left + right)/2;
char *tmp = (char *)array;
int result = cmp(elem, tmp+mid*elemSize);
if (result == 0)
return mid;
else if (result > 0)
left = mid + 1;
else
right = mid - 1;
}
return -1;
}