1 | 5 | 6 | |||||||||||||||||||||||
2 | |||||||||||||||||||||||||
3/4 | 7 | ||||||||||||||||||||||||
1. The amount of memory or storage space required by an algorithm to solve a problem.
2. The maximum amount of resources (such as time or space) required to solve a problem, considering all possible inputs.
3. A way of describing the space or time complexity of an algorithm.
4. The minimum amount of time or space resources required to solve a problem.
5. The expected amount of time or space resources required to solve a problem.
6. An operation whose execution time remains unchanged regardless of input size.
7. The amount of time an algorithm takes to run as a function of the input size.