diff --git a/C++/Linear_search.cpp b/C++/Linear_search.cpp
new file mode 100644
index 0000000..970ef14
--- /dev/null
+++ b/C++/Linear_search.cpp
@@ -0,0 +1,46 @@
+/* ****Yash_mittal**** */
+
+#include<bits/stdc++.h>
+#define ll          long long
+#define pb          push_back
+#define endl        '\n'
+#define pii         pair<ll int,ll int>
+#define vi          vector<ll int>
+#define all(a)      (a).begin(),(a).end()
+#define F           first
+#define S           second
+#define sz(x)       (ll int)x.size()
+#define hell        1000000007
+#define rep(i,a,b)  for(ll int i=a;i<b;i++)
+#define lbnd        lower_bound
+#define ubnd        upper_bound
+#define bs          binary_search
+#define mp          make_pair
+using namespace std;
+
+#define N  100005
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+    int n,x;
+    cin>>n>>x;
+    int arr[n];
+    for(int i=0;i<n;i++)
+        cin>>arr[i];
+    int fl=0;
+    for(int i=0;i<n;i++)
+    {
+        if(arr[i]==x)
+        {
+            cout<<i;
+            fl=1;
+            break;
+        }
+    }
+    if(fl==0)
+        cout<<"Not found";
+    return 0;
+}
\ No newline at end of file
diff --git a/C++/binary_search.cpp b/C++/binary_search.cpp
index c67d585..e2a38b7 100644
--- a/C++/binary_search.cpp
+++ b/C++/binary_search.cpp
@@ -16,7 +16,8 @@ int main()
         cin>>num;
 	first = 0;
 	last = count-1;
-	middle = (first+last)/2;
+	//middle = (first+last)/2; this will go out of range for big values of first and last
+	middle = first + (last-first)/2;
 	while (first <= last)
 	{
 	   if(arr[middle] < num)
@@ -32,7 +33,7 @@ int main()
            else { 
                 last = middle - 1; 
            } 
-           middle = (first + last)/2; 
+           middle = first + (last-first)/2; 
         } 
         if(first > last)
 	{
diff --git a/C++/binarysearch.cpp b/C++/binarysearch.cpp
index ecce212..a8a2614 100644
--- a/C++/binarysearch.cpp
+++ b/C++/binarysearch.cpp
@@ -18,7 +18,8 @@ int main()
     cin>>t;
     l=0,h=n-1;
     while((a[l]!=t)&&(a[h]!=t)){
-        c=(l+h)/2;
+        //c=(l+h)/2; c will go out of range for big value of l and h
+        c = l + (h-l)/2;
         if(a[c]<t){
             l=c;
         }
diff --git a/C++/linear_search b/C++/linear_search
new file mode 100755
index 0000000..053d472
Binary files /dev/null and b/C++/linear_search differ
diff --git a/C++/linear_search.cpp b/C++/linear_search.cpp
new file mode 100644
index 0000000..970ef14
--- /dev/null
+++ b/C++/linear_search.cpp
@@ -0,0 +1,46 @@
+/* ****Yash_mittal**** */
+
+#include<bits/stdc++.h>
+#define ll          long long
+#define pb          push_back
+#define endl        '\n'
+#define pii         pair<ll int,ll int>
+#define vi          vector<ll int>
+#define all(a)      (a).begin(),(a).end()
+#define F           first
+#define S           second
+#define sz(x)       (ll int)x.size()
+#define hell        1000000007
+#define rep(i,a,b)  for(ll int i=a;i<b;i++)
+#define lbnd        lower_bound
+#define ubnd        upper_bound
+#define bs          binary_search
+#define mp          make_pair
+using namespace std;
+
+#define N  100005
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+    int n,x;
+    cin>>n>>x;
+    int arr[n];
+    for(int i=0;i<n;i++)
+        cin>>arr[i];
+    int fl=0;
+    for(int i=0;i<n;i++)
+    {
+        if(arr[i]==x)
+        {
+            cout<<i;
+            fl=1;
+            break;
+        }
+    }
+    if(fl==0)
+        cout<<"Not found";
+    return 0;
+}
\ No newline at end of file