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

Across

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

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

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

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

5. A single item in an array or list.

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

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

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

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

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

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

12. A position number indicating the location of an element within an array or list.

Down

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

14. A collection of elements of the same data type, stored in contiguous memory locations.

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

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

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

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

🖶