This document discusses the average-case analysis of quick sort. It assumes the running time T(n) of quick sort is less than c*n*log(n) for n greater than 2, where c is a constant. Quick sort is recursively splitting the list into sublists until each sublist contains a single element, and it has average-case performance of O(n log n).