One of these uses a positional notation and processes individual digits, and is called "radix."
One of these uses a positional notation and processes individual digits, and is called "radix." Another one of these uses a namesake data structure and the operations of insertion and root deletion, and is the "heap" type. Another one repeatedly steps through a dataset, swapping adjacent pairs of elements if they are in the wrong order, and is named "bubble," and a more famous one was invented by Tony Hoare and is called "quick." For 10 points, name this class of algorithms, whose members order the elements of a given set.
One of these uses a positional notation and processes individual digits, and is called "radix."
{sort}ing algorithms