title: Calculating complexity of algorithm
body: <p>I am not sure if this is a valid question. </p>
  
  <p>Let's assume there is an O(n^3) algorithm which sorts 100 numbers per day with a computing power x.</p>
  
  <p>How many numbers will it be able to sort if the computing power is doubled ie., 2x .</p>
  
  <p>I understand that i din't define 'computing power'. Please correct the question if it is ambiguous or wrong. </p>