Developed by C. A. R. Hoare in 1962, this method of sorting works best when the partition chosen is always ½ the size of the current region to be sorted, and has an expected running time of theta n log n.  
Developed by C. A. R. Hoare in 1962, this method of sorting works best when the partition chosen is always ½ the size of the current region to be sorted, and has an expected running time of theta n log n.  The algorithm works by partitioning the original array into two nonempty subarrays in which no element of the second array is less than any element of the first array. These two subarrays are recursively sorted, and are combined to produce the final sorted array. FTP, name this algorithm, presumably named for its speediness compared to algorithms like the bubble and select sort.
Developed by C. A. R. Hoare in 1962, this method of sorting works best when the partition chosen is always ½ the size of the current region to be sorted, and has an expected running time of theta n log n.  
quicksort