title: Why is sorting a string O(n log n)?
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/487258/plain-english-explanation-of-big-o">Plain English explanation of Big O</a>  </p>
  </blockquote>
  
  
  
  <p>In the answer to a programming puzzle it said sorting a string takes  O(n log n) time.
  How is that derived?</p>
  
  <p>Does anybody have a good reference link for Big O resources.</p>
  
  <p>Thanks</p>