Logarithmic Complexity - O(log(n))
If an algorithm has logarithmic time complexity, it means that the size of the input we are considering gets split into half with each iteration. Let’s say that we have a function that takes 1 second to execute if the input size is 100. With a logarithmic runtime, it would then take 2 seconds if the input size is 1000, and 3 seconds if the input size is 10,000. The bigger the input size gets, the smaller the difference in runtime!
Consider the following array: