Logarithmic Complexity - O(log(n))
The size of the input gets split into half with each iteration of the function. (Reading time: under 2 minutes)
We'll cover the following...
If an algorithm has logarithmic time complexity, it means that the size of the input we are considering gets split into half with each ...