initial commit

Author: adityamangal1

binary_searching.c

@@ -0,0 +1,43 @@
+#include <stdio.h>
+
+int binarysearch(int arr[], int element, int size)
+{
+    int low = 0, high = size - 1;
+    int mid;
+    while (low <= high)
+    {
+        mid = (low + high) / 2;
+        if (element == arr[mid])
+        {
+
+            return mid;
+        }
+        else if (element > arr[mid])
+        {
+            low = mid + 1;
+        }
+        else
+        {
+            high = mid - 1;
+        }
+    }
+    return -1;
+}
+
+int main()
+{
+
+    int arr[50] = {1, 2, 4, 5, 66, 77};
+    int element = 421321, size = 6;
+    int search = binarysearch(arr, element, size);
+    if (search == -1)
+    {
+        printf("Yur element %d was not found in the array\n", element);
+    }
+    else
+    {
+        printf("%d found at %d", element, search);
+    }
+
+    return 0;
+}

linear_searching.c

@@ -0,0 +1,34 @@
+#include <stdio.h>
+
+int Linearsearch(int arr[], int element, int size)
+{
+
+    for (int i = 0; i < size; i++)
+    {
+
+        if (arr[i] == element)
+        {
+
+            return i;
+        }
+    }
+    return 1;
+}
+
+int main()
+{
+
+    int arr[50] = {1, 3, 4, 78, 56, 78};
+    int element = 4432, size = 6;
+    int search = Linearsearch(arr, element, size);
+    if (search == 1)
+    {
+        printf("Yur element %d was not found in the array\n",element);
+    }
+    else
+    {
+        printf("%d found at %d", element, search);
+    }
+
+    return 0;
+}