1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
| /* bsearch example */ #include <stdio.h> /* printf */ #include <stdlib.h> /* qsort, bsearch, NULL */ int compareints (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int values[] = { 50, 20, 60, 40, 10, 30 }; int main () { int * pItem; int key = 40; qsort (values, 6, sizeof (int), compareints); 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; }
|