For 10 points, name this naïve big-oh-of-n-squared sorting algorithm, in which repeated passes are made swapping adjacent out-of-order elements, such that the small elements float to the top.
A "bidirectional" variation of this algorithm passes through the list twice per iteration and is also called "shuttle" or "cocktail," and "odd-even" sort is a parallel-processing optimized alteration; the first method eliminates the problem of small elements at the big-element end, which are called "turtles" since they uniquely must travel the full length of the list. For 10 points, name this naïve big-oh-of-n-squared sorting algorithm, in which repeated passes are made swapping adjacent out-of-order elements, such that the small elements float to the top.
A "bidirectional" variation of this algorithm passes through the list twice per iteration and is also called "shuttle" or "cocktail," and "odd-even" sort is a parallel-processing optimized alteration; the first method eliminates the problem of small elements at the big-element end, which are called "turtles" since they uniquely must travel the full length of the list.
{bubble} sort