Gce Model Questions Vol1 2017 Computer Studies Question 22
Practice objective / multiple choice question 22 from the 2017 Gce Model Questions Vol1 Computer Studies examination.
Two sorting algorithms, A and B, were timed on the same computer for three input sizes. The recorded execution times (in milliseconds) are:\n\n| n | Algorithm A | Algorithm B |\n|---|-------------|-------------|\n| 1000 | 12 | 15 |\n| 2000 | 48 | 30 |\n| 4000 | 192 | 60 |\n\nWhen the input size is doubled, the time for Algorithm A multiplies by a factor of 4, while the time for Algorithm B multiplies by a factor of 2. Based on this evidence, which algorithm has the lower asymptotic time‑complexity for large inputs? Answer with the letter of the algorithm (A or B).
Answer Options
About This Question
This is Gce Model Questions Vol1 2017 Computer Studies Question 22. It is one of the objective questions from the 2017 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.