# Binary Search

- Binary Search Algorithm Complexity - Understand the time complexity of the binary search algorithm, which is O(log n) representing the maximum steps needed to find an element in a sorted array.

- Binary Search Algorithm Complexity - Understand the time complexity of the binary search algorithm, which is O(log n) representing the maximum steps needed to find an element in a sorted array.