Constant

Constant time algorithms are the simplest and most efficient algorithms. They are algorithms that always take the same amount of time to run, regardless of the size of the input. This is the best case scenario for an algorithm, and is the goal of all algorithms.

Visit the following resources to learn more:

• Big O Notation — Calculating Time Complexity
• Big O Notations