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

Across

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

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

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

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

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

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

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

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

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

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

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

Down

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

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

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

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

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

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

18. A single item in an array or list.

🖶