| 1 | 15 | ||||||||||||||||||||||||
| 2 | |||||||||||||||||||||||||
| 18/19 | |||||||||||||||||||||||||
| 3 | |||||||||||||||||||||||||
| 4 | |||||||||||||||||||||||||
| 5 | |||||||||||||||||||||||||
| 6 | 7 | ||||||||||||||||||||||||
| 16 | |||||||||||||||||||||||||
| 8 | |||||||||||||||||||||||||
| 9 | |||||||||||||||||||||||||
| 10/11 | 17 | ||||||||||||||||||||||||
| 12 | |||||||||||||||||||||||||
| 13 | |||||||||||||||||||||||||
| 14 | |||||||||||||||||||||||||
1. A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.
2. An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.
3. A measure of time complexity in which the execution time increases linearly with the size of the input.
4. The scenario in which an algorithm takes the shortest time to complete.
5. A sorting algorithm that preserves the relative order of equal elements in the sorted output.
6. It is a fundamental unit of a binary search tree that contains a value and links to its children.
7. The process of exchanging two items in a list or array.
8. The scenario in which an algorithm takes the most amount of time to solve a given problem.
9. A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.
10. A problem-solving strategy that involves breaking a problem into smaller sub-problems, solving them independently and combining their solutions.
11. 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.
12. The time or space complexity of an algorithm when it receives the best input possible.
13. It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.
14. A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.
15. The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.
16. A collection of elements of the same data type, stored in contiguous memory locations.
17. A measure of how much time and/or space is required to execute an algorithm or program.
18. The amount of time an algorithm takes to solve a problem as a function of the size of the input.
19. The amount of time it takes to complete a task as the input size increases.