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

Across

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

2. The minimum amount of time or space resources required to solve a problem.

3. The time or space complexity of an algorithm when it receives the best input possible.

4. Instructions written in a programming language that are capable of being executed by a computer.

5. An unambiguous step by step set of instructions to solve a problem.

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

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

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

9. Starting with a high-level overview and breaking the problem down into more detailed sub-tasks

10. A sorting algorithm that preserves the relative order of equal elements in the sorted output.

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

12. A command used in a subprogram to show the specific value that will be given back to the main program

Down

13. It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.

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

15. A simplified interface is provided to hide the complexity of lower-level components.

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

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

🖶