Time Complexity Classes: Constant Complexity

• Constant Time Complexity:

  • The algorithm takes a constant amount of time to execute (i.e. independent of the size of the problem to be solved).
  • Obviously, this class is the most efficient. Unfortunately, most “useful” algorithms do not fall into this category. (Could you guess why?)

Previous slide

Next slide

Back to first slide

View graphic version