recently I am learning about logarithmic complexity. Suppose I have a logarithmic time algorithm that takes 1 second to run when the input have size 1. If I change the input
