CompSci 101 - Big-O notation

CompSci 101 - Big-O notation: "O(log n) operations run in logarithmic time – the operation will take longer as the input size increases, but once the input gets fairly large it won’t change enough to worry about. If you double n, you have to spend an extra amount of time t to complete the task. If n doubles again, t won’t double, but will increase by a constant amount."