# Algorithm

- 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.
- Boyer-Moore String Search - The Boyer-Moore algorithm is an efficient string searching algorithm that quickly locates the position of a substring in a larger string by preprocessing the substring.