--- a/docs/Writerside/topics/array_list.h.md	Sat Nov 22 19:16:27 2025 +0100
+++ b/docs/Writerside/topics/array_list.h.md	Sun Nov 23 12:19:24 2025 +0100
@@ -311,6 +311,10 @@
 and the latter function returns the closest element that is larger or equal (the least upper bound / supremum)
 than the searched element.
 
+When the found element appears more than once in the array,
+the binary search and the infimum report the largest index
+and the supremum reports the smallest index of the identical items, respectively.
+
 > Note that all the above functions are only well-defined on arrays which are sorted with respect to the given compare function.
 > 
 > This can, for example, easily be achieved by calling the standard library's `qsort()` function.