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

Across

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

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

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

4. A mathematical notation used to describe the time complexity of an algorithm.

5. A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.

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

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

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

9. A list that is not sorted according to any specific criterion.

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

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

12. A sorting algorithm that does not require extra space for temporary arrays or data structures.

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

Down

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

15. The process of exchanging two items in a list or array.

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

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

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

🖶