Bitonic Sorting Algorithm
Justin R Smith · 1993
Abstract In this section we will discuss one of the first parallel sorting algorithms to be developed. DEFINillON 3.1. A sequence of numbers will be called bitonic if either of the following two conditions is satisfied: It starts out being monotonically increasing up to some point and then becomes monotonically decreasing. It starts out being monotonically decreasing up to some point and then becomes monotonically increasing. A sequence of O ‘s and l ‘s will be called clean if it consists entirely of O ‘s or entirely of l ‘s.