challenge: What is the time complexity of the quicksort algorithm when it selects pivot elements uniformly at random?
  
  A. O(n log n) time regardless of input characteristics
  B. O(n) time with a small constant factor
  C. O(n log n) time with low probability
  D. O(n^2) time
  Answer: 