| 1 | 14 | |||||||||||||||||||||
| 17 | ||||||||||||||||||||||
| 2/3 | ||||||||||||||||||||||
| 12 | 19 | |||||||||||||||||||||
| 15 | 18 | |||||||||||||||||||||
| 4 | ||||||||||||||||||||||
| 16 | ||||||||||||||||||||||
| 5/6 | ||||||||||||||||||||||
| 11 | 7 | |||||||||||||||||||||
| 13 | ||||||||||||||||||||||
| 8 | ||||||||||||||||||||||
| 9 | ||||||||||||||||||||||
| 10 | ||||||||||||||||||||||
1. The scenario in which an algorithm takes the longest time to complete.
2. The scenario in which an algorithm takes an average amount of time to solve a given problem.
3. The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.
4. A position number indicating the location of an element within an array or list.
5. A comparison-based sorting algorithm that repeatedly selects the smallest or largest element from an unsorted region and moves it to the end of the sorted region.
6. A simple sorting algorithm that divides the input list into a sorted and an unsorted region, repeatedly selecting the smallest element from the unsorted region and moving it to the sorted region.
7. A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.
8. An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.
9. A sorting order in which the items are arranged from smallest to largest.
10. Algorithm that searches a list or array one item at a time in a linear fashion.
11. A measure of how much time and/or space is required to execute an algorithm or program.
12. The number of times two elements are swapped during the sorting process.
13. The process of combining two or more sorted sub-arrays into a single sorted array.
14. It is the range of elements in which the binary search algorithm looks for the target element.
15. The scenario in which an algorithm takes the least amount of time to solve a given problem.
16. The number of times two elements are compared during the sorting process.
17. A method for solving a problem by dividing it into progressively smaller subproblems.
18. The time or space complexity of an algorithm when it receives the best input possible.
19. A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.