Question

What is the worst case time complexity of linear search algorithm? ?(1) o(n) o(log n) o(n^2)?

Answer 1

Answer:

Explanation:

O(n)

Answer 2

Heyyyy Dude

Explanation:

Answer is O(n). The worst case is when the element is present in the last position of the array so the complete array is needed to be traversed. As the number of numbers which needs to be covered is n, the time complexity is O(n). Please mark the answer brainliest if it helps :)