2019-06-26 08:04:32 +00:00
|
|
|
#ifndef BINARY_SEARCH_H
|
|
|
|
|
#define BINARY_SEARCH_H
|
|
|
|
|
|
|
|
|
|
// binary_search expects:
|
|
|
|
|
// val: an integer value to search
|
|
|
|
|
// arr[]: an array of *sorted* integers
|
|
|
|
|
// len: the length of ARR[]
|
|
|
|
|
// If val is found, the function returns a pointer to an array index.
|
|
|
|
|
// Otherwise, it returns NULL.
|
2019-06-26 07:56:20 +00:00
|
|
|
int* binary_search(int val, int arr[], int len);
|
2019-06-26 08:04:32 +00:00
|
|
|
|
|
|
|
|
#endif // BINARY_SEARCH_H
|
