C/C++ 库函数 二分查找 bsearch

void * bsearch ( const void * key, const void * base, size_t num, size_t size, int ( * comparator ) ( const void *, const void * ) );

其中比较函数类似这样：

int compareMyType( const void * a, const void * b )
{
	if ( *(MyType*) a > *(MyType*) b )
		return 1;
	if ( *(MyType*) a == *(MyType*) b )
		return 0;
	if ( *(MyType*) a < *(MyType*) b )
		return -1;
}

返回值：

返回值为指针。

如果找不到，就返回NULL。

例子：

/* bsearch example */
#include <stdio.h>
#include <stdlib.h>

int compareints( const void * a, const void * b )
{
	return ( *(int*) a - *(int*) b );
}

int values[] = { 10, 20, 25, 40, 90, 100 };

int main()
{
	int * pItem;
	int key = 40;
	pItem = (int*) bsearch( &key, values, 6, sizeof(int), compareints );
	if ( pItem != NULL )
		printf( "%d is in the array.\n", *pItem );
	else
		printf( "%d is not in the array.\n", key );
	return 0;
}

另一个例子：

/* bsearch example with strings */
#include <stdio.h>
#include <stdlib.h>

char strvalues[][ 20 ] = { "some", "example", "strings", "here" };

int main()
{
	char * pItem;
	char key[ 20 ] = "example";

	/* sort elements in array: */
	qsort( strvalues, 4, 20, (int(*)( const void*, const void* )) strcmp );

	/* search for the key: */
	pItem = (char*) bsearch( key, strvalues, 4, 20, (int(*)( const void*, const void* )) strcmp );

	if ( pItem != NULL )
		printf( "%s is in the array.\n", pItem );
	else
		printf( "%s is not in the array.\n", key );
	return 0;
}