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