Bitonic Sort Visualization

Bitonic Sort is a classic parallel algorithm for sorting. 
Although, the number of comparisons are more than that in any other popular sorting algorithm, It performs better for the parallel implementation because elements are compared in predefined sequence which must not be depended upon the data being sorted. The predefined sequence is called Bitonic sequence.

BITONIC SORTING

To sort a bitonic sequence using bitonic sorting using these steps −

• Step 1 − Create a bitonic sequence.
• Step 2 − Now, we have a bitonic sequence with one part in increasing order and others in decreasing order.
• Step 3 − We will compare and swap the first elements of both halves. Then second, third, fourth elements for them.
• Step 4 − We will compare and swap, every second element of the sequence.
• Step 5 − At last, we will compare and swap adjacent elements of the sequence.
• Step 6 − After all swaps, we will get the sorted array.