Gce Model Questions Vol1 2021 Computer Studies Question 50
Practice objective / multiple choice question 50 from the 2021 Gce Model Questions Vol1 Computer Studies examination.
Given the following pseudo‑code, determine the asymptotic time complexity in Big‑O notation as a function of \(n\):\n\n``` for i = 1 to n: for j = i to n: if j mod i == 0: k = n while k > 0: k = k - i ```\nExplain each reasoning stage leading to the final complexity class.
Answer Options
About This Question
This is Gce Model Questions Vol1 2021 Computer Studies Question 50. It is one of the objective questions from the 2021 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.