| 1 | 12 | 15 | ||||||||||||||||||||||
| 10 | 2 | |||||||||||||||||||||||
| 14 | ||||||||||||||||||||||||
| 3 | ||||||||||||||||||||||||
| 4 | ||||||||||||||||||||||||
| 5 | 11 | |||||||||||||||||||||||
| 13 | ||||||||||||||||||||||||
| 9 | 6 | |||||||||||||||||||||||
| 7 | ||||||||||||||||||||||||
| 8 | ||||||||||||||||||||||||
1. A sorting order in which the items are arranged from largest to smallest.
2. The process of checking two items and determining which one is greater or smaller than the other.
3. The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved.
4. The time or space complexity of an algorithm when it receives the best input possible.
5. The amount of memory used by an algorithm as the input size increases.
6. The process of improving the performance of an algorithm by reducing its time or space complexity.
7. The amount of time it takes to complete a task as the input size increases.
8. Algorithm that repeatedly compares adjacent items in a list or array and swaps them until everything is sorted.
9. The speed and effectiveness with which a task is completed, measured in terms of time and resources used.
10. A sorting algorithm that keeps the original order of elements with equal values.
11. A sorting order in which the items are arranged from smallest to largest.
12. A sorting algorithm that rearranges the original array without using additional memory.
13. The process of exchanging two items in a list or array.
14. The time or space complexity of an algorithm when it receives average inputs.
15. The time or space complexity of an algorithm when it receives the worst input possible.