The spread type of these 
The spread type of these algorithms was invented in 2002 by Steven Ross and is similar to both the bucket and radix type. One of these algorithm has best, average, and worst case run times of n log n; that one repeatedly removes the root of a heap. One of these methods divides an array in half recursively and utilizes a pivot value, while another compares two adjacent elements and switches them if needed. Those methods are, respectively, the quick and bubble types. For 10 points, name these algorithms, including the selection and insertion varieties, that arrange elements in a specific order. 
The spread type of these algorithms was invented in 2002 by Steven Ross and is similar to both the bucket and radix type.
sorting algorithms [accept spreadsort, heapsort, quicksort, or bubble sort] 