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

Across

1. A sorting algorithm that does not require extra space for temporary arrays or data structures.

2. A technique that conceals the inner workings of a procedure and reveals only the essential information.

3. A symbol used in a flowchart to indicate an output or data display point within an algorithm.

4. The central component of the merge sort algorithm is the function that combines two sorted subarrays. Its primary goal is to merge these arrays.

5. It is an array where the elements are arranged in increasing order.

6. A collection of elements of the same data type, stored in contiguous memory locations.

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

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

9. A blueprint for creating objects that encapsulates data and behavior.

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

Down

11. A position number indicating the location of an element within an array or list.

12. The process of executing a program to identify errors.

13. A symbol used in a flowchart to indicate an action taken in an algorithm.

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

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

16. It is a node in a binary search tree that has no children.

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

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

19. An operator that operates on logical values, such as true and false.

🖶