| 1 | 12 | |||||||||||||||||||||||
| 2 | 16 | |||||||||||||||||||||||
| 3 | ||||||||||||||||||||||||
| 4 | 18 | 19 | ||||||||||||||||||||||
| 5 | ||||||||||||||||||||||||
| 6 | ||||||||||||||||||||||||
| 15 | ||||||||||||||||||||||||
| 7 | ||||||||||||||||||||||||
| 14 | ||||||||||||||||||||||||
| 13 | 17 | |||||||||||||||||||||||
| 8 | ||||||||||||||||||||||||
| 9 | ||||||||||||||||||||||||
| 10 | 11 | |||||||||||||||||||||||
1. 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.
2. A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.
3. The scenario in which an algorithm takes an average amount of time to solve a given problem.
4. The process of combining two or more sorted sub-arrays into a single sorted array.
5. The amount of memory an algorithm requires to solve a problem as a function of the size of the input.
6. A sorting algorithm that preserves the relative order of equal elements in the sorted output.
7. A variant of merge sort that does not require extra space for temporary arrays or data structures.
8. A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.
9. A method for solving a problem by dividing it into progressively smaller subproblems.
10. An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.
11. A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.
12. A sorting algorithm that does not require extra space for temporary arrays or data structures.
13. The scenario in which an algorithm takes the most amount of time to solve a given problem.
14. The number of times two elements are compared during the sorting process.
15. The scenario in which an algorithm takes the least amount of time to solve a given problem.
16. A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.
17. Algorithm that divides an array into sub-lists, sorts the sub-lists, and then merges them back together in sorted order.
18. The central component of the merge sort algorithm is the function that combines two sorted subarrays. Its primary goal is to merge these arrays.
19. The amount of time an algorithm takes to solve a problem as a function of the size of the input.