From 968d302cd74c1b794fbfe6033db8d437f9e01111 Mon Sep 17 00:00:00 2001
From: abhishaikm <abhishaikchandrashekhar2@gmail.com>
Date: Fri, 9 May 2025 14:45:05 +0530
Subject: [PATCH 1/2] Create test-3

fork repo testing
---
 test-3 | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 test-3

diff --git a/test-3 b/test-3
new file mode 100644
index 0000000..f3ccdfd
--- /dev/null
+++ b/test-3
@@ -0,0 +1 @@
+this to test fork repo

From 748e48f1e5355d62106f1f18babcf5d2c35008b3 Mon Sep 17 00:00:00 2001
From: abhishaikm <abhishaikchandrashekhar2@gmail.com>
Date: Fri, 9 May 2025 15:12:38 +0530
Subject: [PATCH 2/2] Create test for fork

bubble sort c programme
---
 test for fork | 46 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 test for fork

diff --git a/test for fork b/test for fork
new file mode 100644
index 0000000..bdb395d
--- /dev/null
+++ b/test for fork	
@@ -0,0 +1,46 @@
+// Bubble sort in C
+
+#include <stdio.h>
+
+// perform the bubble sort
+void bubbleSort(int array[], int size) {
+
+  // loop to access each array element
+  for (int step = 0; step < size - 1; ++step) {
+      
+    // loop to compare array elements
+    for (int i = 0; i < size - step - 1; ++i) {
+      
+      // compare two adjacent elements
+      // change > to < to sort in descending order
+      if (array[i] > array[i + 1]) {
+        
+        // swapping occurs if elements
+        // are not in the intended order
+        int temp = array[i];
+        array[i] = array[i + 1];
+        array[i + 1] = temp;
+      }
+    }
+  }
+}
+
+// print array
+void printArray(int array[], int size) {
+  for (int i = 0; i < size; ++i) {
+    printf("%d  ", array[i]);
+  }
+  printf("\n");
+}
+
+int main() {
+  int data[] = {-2, 45, 0, 11, -9};
+  
+  // find the array's length
+  int size = sizeof(data) / sizeof(data[0]);
+
+  bubbleSort(data, size);
+  
+  printf("Sorted Array in Ascending Order:\n");
+  printArray(data, size);
+}