NAME

binary_search - Finds an element in a sorted array

SYNOPSIS

#include "l/l_sort.h"

Example compile flags (system dependent):
  -DLINUX_X86_64 -DLINUX_X86_64_OPTERON  -DGNU_COMPILER 
   -I/home/kobus/include
   -L/home/kobus/misc/load/linux_x86_64_opteron -L/usr/lib/x86_64-linux-gnu
  -lKJB                               -lfftw3  -lgsl -lgslcblas -ljpeg  -lSVM -lstdc++                    -lpthread -lSLATEC -lg2c    -lacml -lacml_mv -lblas -lg2c      -lncursesw 


int binary_search
(
	const void *array,
	int num_elements,
	size_t element_size,
	int (*cmp_fn)(const void *,const void *),
	const void *search_key_ptr
);

DESCRIPTION

This routine finds an element (pointed to by search_key_ptr) in the sorted array "array" by binary search. The search is done with the compare routine "cmp_fn". For searching on integer keys, the routine int_binary_search should be faster, since call backs are not required for comparison (the trade of is slightly less standardized clean and possible portable code).

RETURNS

On success, this routine returns an index into the array. If the element is not found, then it returns NOT_FOUND.

DISCLAIMER

This software is not adequatedly tested. It is recomended that results are checked independantly where appropriate.

AUTHOR

Kobus Barnard

DOCUMENTER