**Heads up!** To view this whole video, sign in with your Courses account or enroll in your free 7-day trial.
Sign In
Enroll

Start a free Courses trial

to watch this video

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

#### Glossary

*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.

#### Resources

**Related Discussions**

Have questions about this video? Start a discussion with the community and Treehouse staff.

Sign up**Related Discussions**

Have questions about this video? Start a discussion with the community and Treehouse staff.

Sign up

You need to sign up for Treehouse in order to download course files.

Sign upYou need to sign up for Treehouse in order to set up Workspace

Sign up