book chapter · 1993

Bitonic Sorting Algorithm

Cited by 1Abstract and details only

Abstract

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.

Cite this paper

APA 7

Smith, J. R. (1993). Bitonic Sorting Algorithm. https://doi.org/10.1093/oso/9780195078817.003.0004

MLA 9

Smith, Justin R. “Bitonic Sorting Algorithm.” 1993, pp. 22–26, https://doi.org/10.1093/oso/9780195078817.003.0004.

Chicago

Smith, Justin R. 1993. “Bitonic Sorting Algorithm.” https://doi.org/10.1093/oso/9780195078817.003.0004.

Harvard

Smith, J.R. (1993) ‘Bitonic Sorting Algorithm’. Available at: https://doi.org/10.1093/oso/9780195078817.003.0004.

BibTeX

@incollection{smith1993bitonic,
  title = {{Bitonic Sorting Algorithm}},
  author = {Smith, Justin R},
  pages = {22--26},
  year = {1993},
  doi = {10.1093/oso/9780195078817.003.0004}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.