|

楼主 |
发表于 2004-5-9 05:30:46
|
显示全部楼层
< >函数名: lfind
功 能: 执行线性搜索
用 法: void *lfind(void *key, void *base, int *nelem, int width,
int (*fcmp)());
程序例: < >#include <stdio.h>
#include <stdlib.h> < >int compare(int *x, int *y)
{
return( *x - *y );
} <P>int main(void)
{
int array[5] = {35, 87, 46, 99, 12};
size_t nelem = 5;
int key;
int *result; <P> key = 99;
result = lfind(&key, array, &nelem,
sizeof(int), (int(*)(const void *,const void *))compare);
if (result)
printf("Number %d found\n",key);
else
printf("Number %d not found\n",key); <P> return 0;
}
</P> |
|