Added C folder

Author: Muhtadi1Laskar

.gitignore

@@ -1 +1,2 @@
-/Ruby/main
+/Ruby/main
+.vscode

C/a.exe

@@ -0,0 +1,34 @@
+#include <stdio.h>
+
+int binarySearch(int array[], int size, int item) {
+    int l = 0;
+    int r = size - 1;
+
+    while(l<=r) {
+        int mid = l + (r-l) / 2;
+
+        if(array[mid] == item) {
+            return mid;
+        }
+        else if(array[mid] > item) {
+            r = mid - 1;
+        }
+        else {
+            l = mid + 1;
+        }
+    }
+    return -1;
+}
+
+
+int main() {
+    int array[] = {1, 2, 3, 4};
+    int size = sizeof(array) / sizeof(array[0]);
+    int item = 1;
+
+    int result = binarySearch(array, size, item);
+
+    
+    printf("%d\n", result);
+    return 0;
+}

C/binary-search.c

@@ -0,0 +1,26 @@
+#include <stdio.h>
+
+void bubbleSort(int array[], int size) {
+    for(int i=0;i<size;i++) {
+        for(int j=i+1;j<size;j++) {
+            if(array[i] > array[j]) {
+                int temp = array[i];
+                array[i] = array[j];
+                array[j] = temp;
+            }
+        }
+    }
+
+    for(int i=0;i<size;i++) {
+        printf("%d\t", array[i]);
+    }
+}
+
+int main() {
+    int array[] = {2, 1, 3, 54, -3, 6, 9};
+    int size = sizeof(array) / sizeof(array[0]);
+
+    bubbleSort(array, size);
+
+    return 0;
+}

C/bubble-sort.c

@@ -0,0 +1,27 @@
+#include <stdio.h>
+
+void insertionSort(int array[], int size) {
+    for(int i=1;i<size;i++) {
+        int j=i-1;
+
+        while(j>=0 && array[j] > array[j+1]) {
+            int temp = array[j];
+            array[j] = array[j+1];
+            array[j+1] = temp;
+            j--;
+        }
+    }
+
+    for(int i=0;i<size;i++) {
+        printf("%d\t", array[i]);
+    }
+}
+
+int main() {
+    int array[] = {4, -34, 6, 3, 6, 5, 6, 3};
+    int size = sizeof(array) / sizeof(array[0]);
+
+    insertionSort(array, size);
+
+    return 0;
+}

C/insertion-sort.c

@@ -0,0 +1,22 @@
+#include <stdio.h>
+
+int linear_search(int array[], int size, int item) {
+    for(int i=0;i<size;i++) {
+        if(array[i] == item) {
+            return i;
+        }
+    }
+    return -1;
+}
+
+int main() {
+    int array[] = {1, 2, 3, 4};
+    int size = sizeof(array) / sizeof(array[0]);
+    int item = 3;
+
+    int result = linear_search(array, size, item);
+
+    printf("%d\n", result);
+    
+    return 0;
+}

C/linear-search.c

@@ -0,0 +1,31 @@
+#include <stdio.h>
+
+void selectionSort(int array[], int size) {
+    for(int i=0;i<size;i++) {
+        int min = i;
+        for(int j=i+1;j<size;j++) {
+            if(array[j] < array[min]) {
+                min = j;
+            }
+        }
+
+        if(i != min) {
+            int temp = array[i];
+            array[i] = array[min];
+            array[min] = temp;
+        }
+    }
+
+    for(int i=0;i<size;i++) {
+        printf("%d\t", array[i]);
+    }
+}
+
+int main() {
+    int array[] = {4, 2, 6, 2, 7, -45, 8};
+    int size = sizeof(array) / sizeof(array[0]);
+
+    selectionSort(array, size);
+
+    return 0;
+}