title: How can I solve a log2N question where input size is doubled?
body: <p>A method is O(Nlog2N). It takes .001 seconds for the method to run when N = 1,000.
  What is the expected time for the method to run when N = 2,000?</p>
  <p>I know the answer to the question is approximately 0.0022, but I don't know how to reach that answer. Can someone help with this?</p>