1										14
			10										16
	9						12
2
							3
											15
	4
				11
							13
5
		6
											7
		8

Across

1. A measure of time complexity in which the execution time increases linearly with the size of the input.

2. The scenario in which an algorithm takes the shortest time to complete.

3. A measure of how well an algorithm uses time and/or space resources.

4. A step-by-step process for solving a problem or achieving a specific goal.

5. The scenario in which an algorithm takes the longest time to complete.

6. A data type that can have one of two possible values, usually true or false.

7. An operation used in a linear search to compare each element of the list with the specified value.

8. The process of finding a specific value within an array or list.

Down

9. The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.

10. The time taken to execute an algorithm or program.

11. A mathematical notation used to describe the time complexity of an algorithm.

12. A single item in an array or list.

13. Algorithm that searches for a specific element in a list or array by checking each element one at a time.

14. A measure of how much time and/or space is required to execute an algorithm or program.

15. Algorithm that searches a list or array one item at a time in a linear fashion.

16. A list that is not sorted according to any specific criterion.

🖶