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

Across

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

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

3. It is a traversing method for binary search trees where the root is visited first, followed by the left and right subtrees recursively.

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

5. A variant of merge sort that does not require extra space for temporary arrays or data structures.

6. The technique of simplifying intricate data by offering a high-level interface.

7. 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.

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

9. Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.

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

Down

11. The process of improving the performance of an algorithm by reducing its time or space complexity.

12. An individual item in a list or array.

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

14. starting with small details and gradually building up to a complete understanding.

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

16. A data type that specifies only the functionality and not the specific way it is implemented.

17. Algorithm that searches a list or array one item at a time in a linear fashion.

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

🖶