algorithm with logn time complexity code example

Example: how to determine if a function has log complexity

Look for an outer loop which iterates through a list (O(n)). Then look to see if there is an inner loop. If the inner loop is cutting/reducing the data set on each iteration, that loop is (O(log n))