Neco 2017 Computer Studies Question 8
Practice objective / multiple choice question 8 from the 2017 Neco Computer Studies examination.
A sorting program can use either Algorithm A with time complexity \(O(n \log_2 n)\) or Algorithm B with time complexity \(O(n^{2})\). For an input size of \(n = 1024\), approximate the number of elementary operations each algorithm would perform (assume the constants are 1) and state which algorithm is faster and by what integer factor (rounded to the nearest whole number).
Answer Options
About This Question
This is Neco 2017 Computer Studies Question 8. It is one of the objective questions from the 2017 Neco 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.