adding new

Author: BaseMax

a.exe

@@ -0,0 +1,19 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void bitonic_sort(int *arr, int n) {
+    
+}
+
+int main(int argc, char** argv) {
+    int arr[] = { 5, 4, 3, 2, 1 };
+    int n = sizeof(arr) / sizeof(arr[0]);
+
+    bitonic_sort(arr, n);
+
+    for (int i = 0; i < n; i++) {
+        printf("%d ", arr[i]);
+    }
+
+    return 0;
+}

bitonic_sort.c

@@ -0,0 +1,39 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void brick_sort(int *arr, int n) {
+    int temp;
+    int is_sorted = 0;
+    while (!is_sorted) {
+        is_sorted = 1;
+        for (int i = 1; i <= n - 2; i += 2) {
+            if (arr[i] > arr[i + 1]) {
+                temp = arr[i];
+                arr[i] = arr[i + 1];
+                arr[i + 1] = temp;
+                is_sorted = 0;
+            }
+        }
+        for (int i = 0; i <= n - 2; i += 2) {
+            if (arr[i] > arr[i + 1]) {
+                temp = arr[i];
+                arr[i] = arr[i + 1];
+                arr[i + 1] = temp;
+                is_sorted = 0;
+            }
+        }
+    }
+}
+
+int main(int argc, char** argv) {
+    int arr[] = { 5, 4, 3, 2, 1 };
+    int n = sizeof(arr) / sizeof(arr[0]);
+
+    brick_sort(arr, n);
+
+    for (int i = 0; i < n; i++) {
+        printf("%d ", arr[i]);
+    }
+
+    return 0;
+}