For 10 points, name these algorithms which order the elements of a list.
John von Neumann invented one of these that has a two-way variant. One of these has "rabbits" and "turtles" that lead to variability in performance. Another of these uses pivots and a divide-and-conquer strategy and is named for its (*) speed. One approach is to go through the array and if any element is less than the element one index lower than it, swap them. This procedure is repeated until no more swapping is needed. Common ones include merge, quick, and bubble. For 10 points, name these algorithms which order the elements of a list.
John von Neumann invented one of these that has a two-way variant.
{sorting} algorithms