Gce Model Questions Vol1 2025 Computer Studies Question 33
Practice objective / multiple choice question 33 from the 2025 Gce Model Questions Vol1 Computer Studies examination.
Consider the following algorithm that processes an array \(A\) of \(n\) integers:\n\n``` for i = 1 to n for j = i to n if A[i] + A[j] is even k = 0 while k < i k = k + 1 ```\n\nWhat is the worst‑case time complexity of this algorithm in Big‑O notation?
Answer Options
About This Question
This is Gce Model Questions Vol1 2025 Computer Studies Question 33. It is one of the objective questions from the 2025 Gce Model Questions Vol1 Computer Studies examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.