ABSTRACT
Sorting is one of the most common tasks in Monte Carlo computing. Two very important sorting algorithms are Quicksort by Hoare (Hoare, 1960) and Heapsort by Press et al. (2007). Quicksort is the fastest known general sorting algorithm. In this section, we are going to discuss several useful sorting algorithms.
