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

Across

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

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

3. A single item in an array or list.

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

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

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

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

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

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

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

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

Down

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

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

14. An ordered collection of data.

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

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

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

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

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

🖶