For 10 points, name these algorithms, examples of which include the bubble, merge, and quick varieties, which accomplish the goal of ordering the items in a list.
Use of the Schwartzian transform can improve the performance of these entities in Perl. Some obstacles in their use are called "rabbits" and "turtles;" the comb variety effectively deals with the latter. A gap sequence is used by the one named for Donald Shell, while least significant bits are key to the radix variety. Another of them, invented by Tony Hoare, utilizes a partition operation after selecting a pivot element. For 10 points, name these algorithms, examples of which include the bubble, merge, and quick varieties, which accomplish the goal of ordering the items in a list.
Use of the Schwartzian transform can improve the performance of these entities in Perl.
{sorting} algorithms [or {sorts}]