| 1/11 | 14 | 18 | |||||||||||||||||||||
| 2 | |||||||||||||||||||||||
| 19 | |||||||||||||||||||||||
| 3 | |||||||||||||||||||||||
| 15 | |||||||||||||||||||||||
| 4 | |||||||||||||||||||||||
| 5 | |||||||||||||||||||||||
| 6 | |||||||||||||||||||||||
| 7 | 12 | ||||||||||||||||||||||
| 8 | 16 | 17 | |||||||||||||||||||||
| 9 | |||||||||||||||||||||||
| 10 | 13 | ||||||||||||||||||||||
1. A measure of how well an algorithm uses time and/or space resources.
2. A measure of how much time and/or space is required to execute an algorithm or program.
3. The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.
4. A data type that can have one of two possible values, usually true or false.
5. A list that is not sorted according to any specific criterion.
6. The time taken to execute an algorithm or program.
7. A measure of time complexity in which the execution time increases linearly with the size of the input.
8. A collection of elements of the same data type, stored in contiguous memory locations.
9. The scenario in which an algorithm takes the shortest time to complete.
10. A step-by-step process for solving a problem or achieving a specific goal.
11. A single item in an array or list.
12. A position number indicating the location of an element within an array or list.
13. An ordered collection of data.
14. An operation used in a linear search to compare each element of the list with the specified value.
15. Algorithm that searches a list or array one item at a time in a linear fashion.
16. The process of finding a specific value within an array or list.
17. Algorithm that searches for a specific element in a list or array by checking each element one at a time.
18. A mathematical notation used to describe the time complexity of an algorithm.
19. The scenario in which an algorithm takes the longest time to complete.