title: time complexity Θ(n log n)
body: <p>if algorithm A has time complexity Θ(n log n) and runs for 10^3 ms on a problem of size 10^4, about how long would you expect it to take to solve a problem of size 10^6?</p>
  
  <p>A.1.5×10^5 ms </p>
  
  <p>B. 10^5 ms</p>
  
  <p>C. 10^6 ms</p>
  
  <p>D.2×10^6 ms</p>
  
  <p>E. 2.4 × 10^8 ms</p>
  
  <p>can anyone tell me how to solve this question?</p>