Many important complexity classes can be defined by bounding the time or space used by the algorithm. Some important complexity classes of decision problems defined in this manner are the following:
What are two examples of measurements are bound within algorithms to establish complexity classes?
time or space time or space time or space