add: graphs et rushs

1 files changed, 16 insertions, 0 deletions

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_ */