backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-15 03:10:07 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for d7af6fdc8c

Browse Source
This commit is contained in:
github-actions
2020-05-29 23:26:30 +00:00
parent edb3d51ec2
commit 7ad1f171c1
176 changed files with 5342 additions and 4288 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
sorting/bitonic_sort.cpp
View File

@@ -9,16 +9,20 @@
/*The parameter dir indicates the sorting direction, ASCENDING
or DESCENDING; if (a[i] > a[j]) agrees with the direction,
then a[i] and a[j] are interchanged.*/
void compAndSwap(int a[], int i, int j, int dir) {
if (dir == (a[i] > a[j])) std::swap(a[i], a[j]);
void compAndSwap(int a[], int i, int j, int dir)
{
if (dir == (a[i] > a[j]))
std::swap(a[i], a[j]);
}
/*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.*/
void bitonicMerge(int a[], int low, int cnt, int dir) {
if (cnt > 1) {
void bitonicMerge(int a[], int low, int cnt, int dir)
{
if (cnt > 1)
{
int k = cnt / 2;
for (int i = low; i < low + k; i++) compAndSwap(a, i, i + k, dir);
bitonicMerge(a, low, k, dir);
@@ -29,8 +33,10 @@ void bitonicMerge(int a[], int low, int cnt, int dir) {
/* This function first produces a bitonic sequence by recursively
sorting its two halves in opposite sorting orders, and then
calls bitonicMerge to make them in the same order */
void bitonicSort(int a[], int low, int cnt, int dir) {
if (cnt > 1) {
void bitonicSort(int a[], int low, int cnt, int dir)
{
if (cnt > 1)
{
int k = cnt / 2;
// sort in ascending order since dir here is 1
@@ -50,7 +56,8 @@ void bitonicSort(int a[], int low, int cnt, int dir) {
void sort(int a[], int N, int up) { bitonicSort(a, 0, N, up); }
// Driver code
int main() {
int main()
{
int a[] = {3, 7, 4, 8, 6, 2, 1, 5};
int N = sizeof(a) / sizeof(a[0]);