1/5			6/7/8
					9
2
	3
	4

Across

1. A way of describing the space or time complexity of an algorithm.

2. The amount of time an algorithm takes to run as a function of the input size.

3. The expected amount of time or space resources required to solve a problem.

4. The amount of memory or storage space required by an algorithm to solve a problem.

Down

5. The minimum amount of time or space resources required to solve a problem.

6. A time or space complexity where the amount of time or memory used increases linearly with the size of the input

7. A time or space complexity where the amount of time or memory used increases logarithmically with the size of the input.

8. An operation whose execution time remains unchanged regardless of input size.

9. The maximum amount of resources (such as time or space) required to solve a problem, considering all possible inputs.

🖶