UTpaper

Free mock tests & test series

Question 170Asked in CIL MT Systems, 24 Aug 2026 (3:00 PM, CBT-26)

What is the worst-case time complexity of a linear search algorithm in an unsorted array of n elements?

  1. AO(1)
  2. BO(log n)
  3. CO(n log n)
  4. DO(n)
Show answerHide answer

Correct answer: (D) O(n)

From CIL MT Systems PYQ, 24 Aug 2026 (3:00 PM, CBT-26)

This is question 170 of CIL MT Systems PYQ, 24 Aug 2026 (3:00 PM, CBT-26). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.