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

Across

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

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

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

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

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

6. A single item in an array or list.

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

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

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

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

Down

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

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

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

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

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

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

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

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

🖶