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

Across

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

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

3. It is the process of visiting all the nodes in a binary search tree in a specific order, such as in-order, pre-order and post-order.

4. The process of combining two or more sorted sub-arrays into a single sorted array.

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

6. It is a fundamental unit of a binary search tree that contains a value and links to its children.

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

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

9. The distribution of power, authority, and decision-making to lower-level entities or individuals.

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

11. The ease with which modifications can be made to a codebase.

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

Down

13. The number of times two elements are compared during the sorting process.

14. The bundling of data and methods that operate on that data within a single unit.

15. It is the length of the longest path from a node to a leaf in a binary search tree.

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

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

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

19. A symbol used in a flowchart to indicate a repetitive action in an algorithm.

🖶