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

Across

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

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

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

4. The arrangement of elements or components into a structure that mirrors their relative significance or connections.

5. A sorting algorithm that keeps the original order of elements with equal values.

6. Algorithm that divides an array into sub-lists, sorts the sub-lists, and then merges them back together in sorted order.

7. A set of rules used to reduce the size of data by removing redundant information.

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

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

10. A measure of time complexity in which the execution time increases linearly with the size of the input.

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

Down

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

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

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

15. A flowchart symbol used to indicate the start or end of an algorithm.

16. An instance of a class that contains both data and methods.

17. An algorithm which searches for a specific element in a list or array.

18. A subroutine that executes specific tasks within a program and provides a returned value when called.

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

🖶