Invented by Tony Hoare in 1961, its advantages include its ability to operate in place and the velocity of its inner loop. Its effectiveness can be greatly increased by using various strategies to choose an efficient pivot. After a pivot is selected, all numbers less than the pivot are placed to the left, and all numbers larger than the pivot are placed to the right, with the algorithm then implemented recursively on the 
Invented by Tony Hoare in 1961, its advantages include its ability to operate in place and the velocity of its inner loop. Its effectiveness can be greatly increased by using various strategies to choose an efficient pivot. After a pivot is selected, all numbers less than the pivot are placed to the left, and all numbers larger than the pivot are placed to the right, with the algorithm then implemented recursively on the smaller lists. FTP, what is this computer science sorting algorithm named for its purported speed?
Invented by Tony Hoare in 1961, its advantages include its ability to operate in place and the velocity of its inner loop.
quicksort