void *bsearch(const void *key, const void *base, unsigned int tsize,
unsigned int esize, int (*compare)(const void *, const void *));
void qsort(void *base, unsigned int tsize, unsigned int esize,
int (*compare)(const void *, const void *));
Here is an example:
int icomp(void *a, void *b)
{
return( *( (int *) a) > *( (int *) b) );
}
int main()
{
int i, a[100];
for ( i = 0; i < 100; i++ )
a[i] = i * i + i;
i = 37;
printf( "%d", bsearch(&i, a, 100, sizeof(int), icomp );
}
int i, a[100];
for ( i = 0; i < 100; i++ )
a[i] = rand();
qsort( a, 100, sizeof(int), icomp );