Explanation
In a Linear Search algorithm, elements of the array are checked sequentially one by one from start to end until the desired element is found or the end of the array is reached.
Worst-Case Scenario: The target element is either present at the very last position of the array or is completely absent from the array.
In both cases, the algorithm has to check all N elements in the array.
Therefore, the total number of comparisons in the worst case is proportional to N, making the time complexity O(N).
Correct Answer: (C) O(N)
