A sorting algorithm runs in time $T(n)=5n\log_{2}n$ milliseconds for an input of $n$ items. A revised version reduces the constant factor by 20% but adds a fixed overhead of 150 ms. For $n=2000$, which version is faster and by how many milliseconds?

Question

Accepted Answer

The revised version is faster by 21,780 ms.

Neco 2024 Computer Studies Question 43

A sorting algorithm runs in time \(T(n)=5n\log_{2}n\) milliseconds for an input of \(n\) items. A revised version reduces the constant factor by 20% but adds a fixed overhead of 150 ms. For \(n=2000\), which version is faster and by how many milliseconds?

Answer Options

About This Question

Master the Exam!