Random permutation statistics
The statistics of random permutations, such as the cycle structure of a random permutation, are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example, that we are using quickselect (a cousin of quicksort) to select a random element of a random permutation.
Source: Wikipedia — Random permutation statistics (CC BY-SA 4.0)