| 1 | 14 | ||||||||||||||||||||||||
| 18 | |||||||||||||||||||||||||
| 2 | |||||||||||||||||||||||||
| 3 | |||||||||||||||||||||||||
| 4 | |||||||||||||||||||||||||
| 17 | |||||||||||||||||||||||||
| 5 | 16 | ||||||||||||||||||||||||
| 6 | |||||||||||||||||||||||||
| 7 | |||||||||||||||||||||||||
| 15 | |||||||||||||||||||||||||
| 13 | 8 | ||||||||||||||||||||||||
| 9 | |||||||||||||||||||||||||
| 10 | |||||||||||||||||||||||||
| 11 | |||||||||||||||||||||||||
| 12 | |||||||||||||||||||||||||
1. A measure of how much time and/or space is required to execute an algorithm or program.
2. A method for solving a problem by dividing it into progressively smaller subproblems.
3. The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved.
4. It is a traversing method for binary search trees where the left and right subtrees are first recursively traversed, followed by the root.
5. A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.
6. The time or space complexity of an algorithm when it receives average inputs.
7. The scenario in which an algorithm takes the most amount of time to solve a given problem.
8. Algorithm that searches for a specific element in a list or array by checking each element one at a time.
9. It is a traversing method for binary search trees where the root is visited first, followed by the left and right subtrees recursively.
10. The time taken to execute an algorithm or program.
11. The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.
12. The amount of memory an algorithm requires to solve a problem as a function of the size of the input.
13. The number of times two elements are compared during the sorting process.
14. A variant of merge sort that does not require extra space for temporary arrays or data structures.
15. A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.
16. It is an array where the elements are arranged in increasing order.
17. It is a traversing method for binary search trees where the left subtree is recursively traversed, followed by the root, and then the right subtree.
18. It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.