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

Across

1. Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.

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

3. A series of actions or steps taken in order to achieve a particular end.

4. A named storage location in memory that can store modifiable data.

5. The process of arranging data in a particular order.

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

7. The ability to present the same interface for different underlying data types.

8. The number of times two elements are swapped during the sorting process.

9. The amount of memory used by an algorithm as the input size increases.

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

11. A sorting algorithm that keeps the original order of elements with equal values.

12. A program module that performs a specific task within a larger program.

13. A modular, reusable, and self-contained part of a larger system.

Down

14. Algorithm that repeatedly compares adjacent items in a list or array and swaps them until everything is sorted.

15. A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.

16. A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.

17. A symbol used in a flowchart to indicate an input or data entry point in an algorithm.

18. The scenario in which an algorithm takes the least amount of time to solve a given problem.

19. A command in a program that activates a subprogram allowing it to run and perform its tasks.

🖶