From e4291e9fb3752818c83a80ba61fab27a680acd0e Mon Sep 17 00:00:00 2001
From: CHiGi <58292903+imCHiGi@users.noreply.github.com>
Date: Tue, 4 Oct 2022 03:04:48 +0530
Subject: [PATCH] Create LinearSearch.c

---
 searching_algorithms/LinearSearch.c | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 searching_algorithms/LinearSearch.c

diff --git a/searching_algorithms/LinearSearch.c b/searching_algorithms/LinearSearch.c
new file mode 100644
index 0000000..6c4cf21
--- /dev/null
+++ b/searching_algorithms/LinearSearch.c
@@ -0,0 +1,21 @@
+
+# Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found.
+# Time complexity: O(N)
+
+
+void linearSearch(int arr[], int n, int search)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        if (arr[i] == search)
+        {
+            printf("Element found at location: %d\n", i + 1);
+            break;
+        }
+    }
+    if (i == n)
+    {
+        printf("Not Found!\n");
+    }
+}