Big O Notation Series #10: Log n Complexity Explained With An Iterative Function [Logarithmic time]