A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/d8/d8f/bitonic__sort_8cpp_source.html below:

TheAlgorithms/C++: sorting/bitonic_sort.cpp Source File

12void

compAndSwap(

int

a[],

int

i,

int

j,

int

dir) {

13 if

(dir == (a[i] > a[j]))

14

std::swap(a[i], a[j]);

21void

bitonicMerge(

int

a[],

int

low,

int

cnt,

int

dir) {

24 for

(

int

i = low; i < low +

k

; i++) compAndSwap(a, i, i + k, dir);

25

bitonicMerge(a, low, k, dir);

26

bitonicMerge(a, low + k, k, dir);

33void

bitonicSort(

int

a[],

int

low,

int

cnt,

int

dir) {

38

bitonicSort(a, low, k, 1);

41

bitonicSort(a, low + k, k, 0);

45

bitonicMerge(a, low, cnt, dir);

51void

sort(

int

a[],

int

N,

int

up) { bitonicSort(a, 0, N, up); }

55 int

a[] = {3, 7, 4, 8, 6, 2, 1, 5};

56 int

N =

sizeof

(a) /

sizeof

(a[0]);

61

std::cout <<

"Sorted array: \n"

;

62 for

(

int

i = 0; i < N; i++) std::cout << a[i] <<

" "

;

double k(double x)

Another test function.

int main()

Main function.


RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4