Input: SORTED array, target

Output: element_index or -1 if is not present in array

Complexity: $O(logn)$

https://skine.ru/articles/532472/

Algorithm:

<aside> ⚙️ int left = 0; int right = n-1; target ? $a_{mid}$:

1. target == $a_{mid}$ → found.
2. target > $a_{mid}$ → left = mid + 1; repeat procedure for new left and right;
3. target < $a_{mid}$ → right = mid - 1; repeat procedure for new left and right; </aside>