Gce Model Questions Vol1 2025 Computer Studies Question 19
Practice objective / multiple choice question 19 from the 2025 Gce Model Questions Vol1 Computer Studies examination.
A program sorts an array of 10 000 integers using bubble sort. In the worst case bubble sort makes \(\frac{n(n-1)}{2}\) comparisons, each taking 0.2 µs. The same array is then sorted with merge sort, which requires about \(n\log_{2}n\) comparisons, each taking 0.05 µs. Calculate the time taken by each algorithm (in seconds) and the time saved by using merge sort.
Answer Options
About This Question
This is Gce Model Questions Vol1 2025 Computer Studies Question 19. 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.