title: Expected running time vs. worst-case running time
body: <p>I am studying the randomized-quicksort algorithm. I realized that the running time of this algorithm is always represented as "expected running time".</p>
  
  <p>What is the reason for specifying or using the "expected running time"? Why don't we calculate the worst- or average-case?</p>