diff --git a/linear_binanary_search.cpp b/linear_binanary_search.cpp
new file mode 100644
index 0000000..4450290
--- /dev/null
+++ b/linear_binanary_search.cpp
@@ -0,0 +1,22 @@
+#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; 
+}