Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages

  
 
  

home | help
BSEARCH(3)		   Linux Programmer's Manual		    BSEARCH(3)

NAME
       bsearch - binary	search of a sorted array.

SYNOPSIS
       #include	<stdlib.h>

       void *bsearch(const void	*key, const void *base,	size_t nmemb,
	      size_t size, int (*compar)(const void *, const void *));

DESCRIPTION
       The  bsearch() function searches	an array of nmemb objects, the initial
       member of which is pointed to by	base, for a member  that  matches  the
       object  pointed	to  by	key.   The size	of each	member of the array is
       specified by size.

       The contents of the array should	be in ascending	sorted order according
       to the comparison function referenced by	compar.	 The compar routine is
       expected	to have	two arguments which point to the key object and	to  an
       array  member,  in  that	order, and should return an integer less than,
       equal to, or greater than zero if the  key  object  is  found,  respec-
       tively, to be less than,	to match, or be	greater	than the array member.

RETURN VALUE
       The  bsearch()  function	 returns a pointer to a	matching member	of the
       array, or NULL if no match is found.  If	there  are  multiple  elements
       that match the key, the element returned	is unspecified.

CONFORMING TO
       SVID 3, BSD 4.3,	ISO 9899 (C99)

SEE ALSO
       qsort(3)

GNU				  1993-03-29			    BSEARCH(3)

NAME | SYNOPSIS | DESCRIPTION | RETURN VALUE | CONFORMING TO | SEE ALSO

Want to link to this manual page? Use this URL:
<https://www.freebsd.org/cgi/man.cgi?query=bsearch&sektion=3&manpath=Red+Hat+9>

home | help