Gce Model Questions Vol1 2018 Computer Studies Question 12

Practice objective / multiple choice question 12 from the 2018 Gce Model Questions Vol1 Computer Studies examination.

Gce Model Questions Vol1 2018 Computer Studies Objective / Multiple Choice Medium Difficulty
Question 12 GCE_MODEL_QUESTIONS_VOL1 • 2018 • COMPUTER_STUDIES • objective

A program processes an array of \(n\) integers. For each index \(i\) (\(1 \le i \le n\)) it searches linearly through the first \(i\) elements to find the maximum value among them. The outer loop stops immediately if it encounters an element equal to a given target value \(T\), which is guaranteed to be present somewhere in the array. What is the worst‑case time complexity of this algorithm in Big‑O notation?

Answer Options

A. O(n)
B. O(n^3)
C. O(n log n)
Correct Answer D. O(n^2)
Correct Answer
D
Correct Option:
O(n^2)

About This Question

This is Gce Model Questions Vol1 2018 Computer Studies Question 12. It is one of the objective questions from the 2018 Gce Model Questions Vol1 Computer Studies examination.

Difficulty level: Medium .

View More Gce Model Questions Vol1 2018 Computer Studies Questions More Gce Model Questions Vol1 Practice Questions Back to Questions

Master the Exam!

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows
Chat with Support