NAME

int_linear_search - Finds an element in an array with integer key

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 int_linear_search
(
	const void *array,
	int num_elements,
	size_t element_size,
	size_t element_offset,
	int search_key
);

DESCRIPTION

This routine finds an element in the array "array" with a linear search assuming that the key is an integer. The array need not be sorted.

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

Kobus Barnard

SEE ALSO

kjb_sort , check_sort , int_sort , long_sort , binary_search , int_binary_search , long_binary_search , binary_search_int_array , binary_search_long_array , linear_search , long_linear_search , linear_search_int_array , linear_search_long_array