MCPcopy Create free account
hub / github.com/TheAlgorithms/C-Plus-Plus / bitonicMerge

Function bitonicMerge

sorting/bitonic_sort.cpp:21–28  ·  view source on GitHub ↗

It recursively sorts a bitonic sequence in ascending order, if dir = 1, and in descending order otherwise (means dir=0). The sequence to be sorted starts at index position low, the parameter cnt is the number of elements to be sorted.*/

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

bitonicSortFunction · 0.85

Calls 1

compAndSwapFunction · 0.85

Tested by

no test coverage detected