Other methods include a divide-and-conquer algorithm using a pivot value, and, in another type of this process, "rabbits" are put in the correct place very quickly, while "turtles" find their way through the list slowly.
Random permutations of the objects involved in this process are generated until the correct permutation is found in the bogo type of this process. If the values of the elements involved come from a known finite set like the integers, then the radix one of these processes is appropriate. Other methods include a divide-and-conquer algorithm using a pivot value, and, in another type of this process, "rabbits" are put in the correct place very quickly, while "turtles" find their way through the list slowly. For 10 points, quick and bubble are types of which algorithms that arrange the elements of a list in ascending or descending order.
Random permutations of the objects involved in this process are generated until the correct permutation is found in the bogo type of this process.
{sort}ing algorithms [accept {bogosort} before "bogo" is read]