The time complexity of linear search algorithms in the text is linear time.
A linear-time algorithm is the time complexity of the algorithm, denoted by O(n). Execution time increases linearly with the size of the input.
The worst-case linear search runs in linear time. In other words, if your array has n elements and the element you're looking for is the last, you'll need to make n comparisons.
Learn more about linear search algorithms here:
https://brainly.com/question/13383947
#SPJ4
