diff --git a/LinearSearch/linear.java b/LinearSearch/linear.java
new file mode 100644
index 0000000..3fa764f
--- /dev/null
+++ b/LinearSearch/linear.java
@@ -0,0 +1,22 @@
+package com.company.LinearSearch;
+import java.util.Scanner;
+public class linear{
+
+    public static void main(String[] args){
+        Scanner sc=new Scanner(System.in);
+        System.out.print("Enter the  size of array: ");
+        int n=sc.nextInt();
+        int[] arr=new int[n];
+        for(int i=0;i<n;i++)
+       {
+            arr[i]=sc.nextInt();
+        }
+        System.out.print("Enter the number to be searched : ");
+        int x=sc.nextInt();
+        for(int i=0;i<n;i++)
+        {
+            if(arr[i]==x)
+            System.out.println("element found");
+        }
+    }
+}
\ No newline at end of file
diff --git a/src/com/company/BinarySearch/angry_birds.class b/src/com/company/BinarySearch/angry_birds.class
new file mode 100644
index 0000000..0e23cde
Binary files /dev/null and b/src/com/company/BinarySearch/angry_birds.class differ
diff --git a/src/com/company/BinarySearch/angry_birds.java b/src/com/company/BinarySearch/angry_birds.java
deleted file mode 100644
index a809b30..0000000
--- a/src/com/company/BinarySearch/angry_birds.java
+++ /dev/null
@@ -1,55 +0,0 @@
-package com.company.BinarySearch;
-
-import java.util.ArrayList;
-import java.util.Collections;
-
-public class angry_birds {
-    public static boolean canPlaceBirds(int B,int N,ArrayList<Integer> nests,int sep) {
-        int birds = 1;
-        int location = nests.get(0);
-
-        for(int i=1; i<=N-1; i++){
-            int current_location = nests.get(i);
-            if(current_location - location >= sep){
-                birds++;
-                location = current_location;
-
-                if(birds==B){
-                    return true;
-                }
-            }
-        }
-        return false;
-
-    }
-    public static void main(String[] args) {
-        int b = 3;
-        ArrayList<Integer> nests =new ArrayList<>();
-        nests.add(1);
-        nests.add(2);
-        nests.add(4);
-        nests.add(8);
-        nests.add(9);
-
-        Collections.sort(nests);
-        int N = nests.size();
-        //Binary Search
-        int s = 0;
-        int e = nests.get(N-1) - nests.get(0);
-        int ans = -1;
-
-        while(s<=e){
-            int mid = (s+e)/2;
-
-            boolean canPlace = canPlaceBirds(b,N,nests,mid);
-            if(canPlace){
-                ans = mid;
-                s = mid + 1;
-            }
-            else{
-                e = mid - 1;
-            }
-        }
-        System.out.println(ans);
-    }
-}