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

Across

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

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

3. The speed and effectiveness with which a task is completed, measured in terms of time and resources used.

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

5. The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved.

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

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

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

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

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

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

Down

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

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

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

15. The amount of memory used by an algorithm as the input size increases.

🖶