You keep halving an array and check if it’s greater or less than the other side. This gives you a runtime of O(log(n))