The complexity of Binary Search Algorithm is expressed as:

The Binary Search Algorithm has a time complexity of O(log₂ n). This is because the algorithm repeatedly divides the search space in half with each iteration. Starting with a sorted array of size n, after k iterations, the remaining search space is n / 2^k. The algorithm terminates when the search space reduces to 1, meaning 2^k = n, or k = log₂ n.