bitonic sort排序的C语言代码

以下是bitonic sort排序的C语言代码：

#include <stdio.h>
#include <stdlib.h>
#include <omp.h>

void compare_swap(int *a, int *b, int dir) {
if (dir == (*a > *b)) {
int tmp = *a;
*a = *b;
*b = tmp;
}
}

void bitonic_merge(int *arr, int low, int cnt, int dir) {
if (cnt > 1) {
int k = cnt / 2;
#pragma omp parallel for
for (int i = low; i < low + k; i++) {
compare_swap(&arr[i], &arr[i + k], dir);
}
bitonic_merge(arr, low, k, dir);
bitonic_merge(arr, low + k, k, dir);
}
}

void bitonic_sort(int *arr, int low, int cnt, int dir) {
if (cnt > 1) {
int k = cnt / 2;
bitonic_sort(arr, low, k, 1);
bitonic_sort(arr, low + k, k, 0);
bitonic_merge(arr, low, cnt, dir);
}
}

int main() {
int n = 10;
int arr[10] = {3, 7, 4, 8, 6, 2, 1, 5, 9, 0};
bitonic_sort(arr, 0, n, 1);
printf("Sorted array: ");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
return 0;
}