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

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 shortest time to complete.

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

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

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

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

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

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

9. A single item in an array or list.

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

11. An ordered collection of data.

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

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

Down

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

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

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

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.

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

🖶