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

Across

1. It is the point in the search interval that divides it into two equal halves.

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

3. A language used to describe programming concepts using a mix of natural language and programming code.

4. The process of finding a specific value within an array or list.

5. The process of finding a particular item in a collection of data.

6. Breaking a problem into smaller, more manageable parts, solving them individually, and then combining the solutions.

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

8. The process of checking two items and determining which one is greater or smaller than the other.

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

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

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

12. A command in a program that activates a subprogram allowing it to run and perform its tasks.

Down

13. A simple sorting algorithm that divides the input list into a sorted and an unsorted region, repeatedly selecting the smallest element from the unsorted region and moving it to the sorted region.

14. The process of dividing a complex problem or system into smaller, more manageable subproblems or components.

15. It is the range of elements in which the binary search algorithm looks for the target element.

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

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

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

🖶