Constant and Logarithmic Time6:32 with Pasan Premaratne
As you learn about algorithms you will run (pun intended) into some common runtimes that algorithms exhibit. In this video we'll look at two of them - constant and logarithmic runtimes
Constant Time - O(1): The runtime of the algorithm is independent of the size of the data set. If n is 1 or 1 million it takes the same amount of time to execute the algorithm.
Logarithmic Time - O(log n): The runtime of the algorithm increases logarithmically as the size of the data set increases.
You need to sign up for Treehouse in order to download course files.Sign up