What is the algorithmic complexity of binary search in a sorted array? (O(1) / O(log n) / O(n) / O(n^2))

The algorithmic complexity of binary search in a sorted array is O(log n).

This is because, at each step of the search, we divide the search area in half, reducing the number of elements to check by two, until we find the desired element or confirm that it does not exist.