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