Linear Search Algorithm

Linear Search Algorithm

@@ -0,0 +1,27 @@
+//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, 
+//otherwise the search continues till the end of the data set.
+#include <iostream>
+using namespace std;
+
+int search(int arr[], int N, int x)
+{
+    int i;
+    for (i = 0; i < N; i++)
+        if (arr[i] == x)
+            return i;
+    return -1;
+}
+
+int main(void)
+{
+    int arr[] = { 2, 3, 4, 10, 40 };
+    int x = 10;
+    int N = sizeof(arr) / sizeof(arr[0]);
+
+    int result = search(arr, N, x);
+    (result == -1)
+        ? cout << "Element is not present in array"
+        : cout << "Element is present at index " << result;
+    return 0;
+}