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

Across

1. The amount of memory or storage space required by an algorithm to solve a problem.

2. A time or space complexity where the amount of time or memory used grows quadratically with the size of the input.

3. A high-level description of an algorithm that uses a combination of natural language and programming syntax.

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

5. A programming construct that decides the sequence in which blocks of code are executed.

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

7. The maximum amount of resources (such as time or space) required to solve a problem, considering all possible inputs.

8. The process of repeating a set of instructions until a specific condition is met.

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

Down

10. An algorithm which puts elements in a list or array in a specific order.

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

12. The expected amount of time or space resources required to solve a problem.

13. The set of rules and patterns that govern the structure and format of programming languages.

14. A line used in a flowchart to indicate the direction of flow in an algorithm.

15. Solving a problem by breaking it down into smaller subproblems and solving them independently.

16. A control structure that executes instructions until a condition is met or a number of iterations is reached.

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

18. The process of using rational thinking and deduction to arrive at conclusions or make decisions.

19. A measure of how well an algorithm solves a problem, often in terms of time and computational resources required.

🖶