A parallel approach to this algorithm requires only n over two iterations and is known as either alternating or odd-even.  
A parallel approach to this algorithm requires only n over two iterations and is known as either alternating or odd-even.  One optimization to this algorithm is the Cocktail approach, while it is improved significantly with the Combing approach because the turtles that normally slow down this algorithm move faster because they're compared with elements far apart. Although it shares a Big O of n squared runtime with Insertion Sort, it is typically much slower for randomized data.  Functioning by swapping pairs of elements in the wrong order, for 10 points, identify this naive sorting algorithm.
A parallel approach to this algorithm requires only n over two iterations and is known as either alternating or odd-even.  
{Bubble Sort} (prompt on just "Sort")