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

Across

1. A problem-solving strategy that involves breaking a problem into smaller sub-problems, solving them independently and combining their solutions.

2. The amount of time an algorithm takes to run as a function of the input size.

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

4. A control structure that enables a program to execute blocks of code depending on certain conditions.

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

6. A subroutine that executes specific tasks within a program and provides a returned value when called.

7. A sorting order in which the items are arranged from smallest to largest.

8. Breaking a system into smaller, loosely-coupled components that can be independently developed and maintained.

9. Algorithm that divides an array into sub-lists, sorts the sub-lists, and then merges them back together in sorted order.

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

Down

11. Software used to create and edit flowcharts.

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

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

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

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

16. A symbol used in a flowchart to connect different parts of an algorithm.

🖶