O( log N) is the Big O way of describing an algorithm that increases one step each time the data is doubled. As we learned in the previous chapter, binary search does just that.551 ↱

# A Common-Sense Guide to Data Structures and Algorithms

## Level Up Your Core Programming Skills

Jay Wengrow