diff --git a/Binary_Search.java b/Binary_Search.java
new file mode 100644
index 0000000..46ac95b
--- /dev/null
+++ b/Binary_Search.java
@@ -0,0 +1,21 @@
+import java.util.Arrays;
+public class Binary_Search {
+
+public static void main(String[] args) {
+  int [] array={10,15,20,11,25,30,35};
+Reverse_Array(array);
+}
+//Reverse an array
+
+static void Reverse_Array(int[] array) {
+int start=0,end=array.length-1;
+for (int i = start; i <end; i++) {
+int temp=array[i];
+array[i]=array[end];
+array[end]=temp;
+end--;
+}
+System.out.println(Arrays.toString(array));
+return;
+}
+}
diff --git a/Linear_Search.java b/Linear_Search.java
new file mode 100644
index 0000000..f0fbc5f
--- /dev/null
+++ b/Linear_Search.java
@@ -0,0 +1,20 @@
+public class Linear_Search {
+
+public static void main(String[] args){
+Scanner sc= new Scanner(System.in);
+System.out.print("Enter : ");
+String find=sc.nextLine();
+int [] array={10,23,20,1,65,87};
+System.out.println(Linear_Search(array));
+sc.close();
+}
+// Linear Search on String
+static int Linear_Search(int [] array) {
+// Find min Value
+for (int i = 0; i <array.length; i++) {
+if(min < array[i]){
+min=array[i];
+}
+}
+}
+}