engineering computer science MCQ #1252

What is the time complexity of Linear Search?

engineering computer science MCQ #1252

  1. Question 1

    Q1. What is the time complexity of Linear Search?

    • A) O(1)
    • B) O(log n)
    • C) O(n)
    • D) O(n log n)

    Answer: O(n)

    Explanation: Linear Search checks each element sequentially, resulting in a time complexity of O(n) as the number of comparisons grows linearly with the size of the input.