Analysis of Algorithms
University of South Carolina
September 16, 2010
Sorting and Order Statistics Problems
Sorting is fundamental in the study of algorithms, with a wide
variety of applications.
Input: A sequence of n numbers a1, a2, . . . , an .
Output: A permutation (reordering) a1, a2, . . . , an of the