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

Across

1. A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.

2. An ordered collection of data.

3. The amount of time it takes to complete a task as the input size increases.

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

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

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

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

8. A problem-solving strategy that involves breaking a problem into sub-problems, solving each sub-problem independently, and then combining the solutions to solve the original problem.

9. A sorting algorithm that rearranges the original array without using additional memory.

10. Algorithm that searches for a specific element in a list or array by checking each element one at a time.

11. The scenario in which an algorithm takes the least amount of time to solve a given problem.

Down

12. Algorithm that repeatedly compares adjacent items in a list or array and swaps them until everything is sorted.

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

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

15. A method for solving a problem by dividing it into progressively smaller subproblems.

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

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

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

19. It is the element being searched for in the binary search algorithm.

🖶