From c9b6b9a5ca082fe7c1b6f58d7713f785a9eb6a5c Mon Sep 17 00:00:00 2001 From: Martial Simon Date: Mon, 15 Sep 2025 01:08:27 +0200 Subject: add: graphs et rushs --- rushs/evalexpr/binary_search_ptr/bsearch.h | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 rushs/evalexpr/binary_search_ptr/bsearch.h (limited to 'rushs/evalexpr/binary_search_ptr/bsearch.h') diff --git a/rushs/evalexpr/binary_search_ptr/bsearch.h b/rushs/evalexpr/binary_search_ptr/bsearch.h new file mode 100644 index 0000000..e011744 --- /dev/null +++ b/rushs/evalexpr/binary_search_ptr/bsearch.h @@ -0,0 +1,16 @@ +#ifndef BSEARCH_H_ +#define BSEARCH_H_ + +/* +** Search `elt` in the memory range of [`begin` - `end`[. +** `begin` is a pointer to the first element. +** `end` is a pointer **AFTER** the last element. +** The elements in the range [`begin` - `end`[ are sorted in ascending order. +** If the range is empty, `begin` == `end`. +** `begin` and `end` can't be `NULL`. +** Returns a pointer to the element if found, or a pointer to the memory +** location where the element could be inserted to keep the array sorted. +*/ +int *binary_search(int *begin, int *end, int elt); + +#endif /* !BSEARCH_H_ */ -- cgit v1.2.3