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

Across

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

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

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

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

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

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

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

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

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

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

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

Down

12. An ordered collection of data.

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

14. A single item in an array or list.

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

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

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

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

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

🖶