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

Across

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

2. An individual item in a list or array.

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. A sorting algorithm that does not require extra space for temporary arrays or data structures.

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

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

7. The time or space complexity of an algorithm when it receives the worst input possible.

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

9. The scenario in which an algorithm takes the longest time to complete.

10. The amount of time an algorithm takes to solve a problem as a function of the size of the input.

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

Down

12. The amount of memory an algorithm requires to solve a problem as a function of the size of the input.

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

14. A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.

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

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

17. The time or space complexity of an algorithm when it receives average inputs.

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

🖶