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

Across

1. A sorting algorithm that necessitates extra memory in order to arrange the array.

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

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

4. A problem-solving strategy that involves breaking a problem into smaller sub-problems, solving them independently and combining their solutions.

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

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

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

8. It is the range of elements in which the binary search algorithm looks for the target element.

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

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

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

Down

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

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

14. A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.

15. An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.

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

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

🖶