title: Calculate simulated running time based on time complexity of the algorithm
body: <p>How can we calculate the simulated running time of an algorithm based on its time complexity? For instance, if we know that the time complexity of an algorithm is O(n), then what will be its running time in a discrete event simulator? I believe the simulator needs to take into account the capacity of the node running the algorithm, but how do we use these to calculate the running time. </p>
  
  <p>In the simulator, I have a central node which broadcasts messages. Each receiving node of the broadcasted message handles the message like this:</p>
  
  <pre><code>handleMessage(){
  
     processMessage();
  
     replyToCentralNode
  }
  </code></pre>
  
  <p>In the simulator, how do I calculate the execution time of processMessage? Can I get something like 10s, or 0.1ms?</p>