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

Across

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

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

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

4. A single item in an array or list.

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

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

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

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

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

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

Down

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

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

13. An ordered collection of data.

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

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

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

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

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

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

🖶