Update arx.java

pand-coder · web-flow · commit 1cb76ac62804 · 2024-04-27T00:55:24.000+05:30
diff --git a/arx.java b/arx.java
@@ -1,21 +1,31 @@
 import java.util.Scanner;
 class Search{
-    public void linearsearch(n,arr)
+    public void linearsearch(arr,key)
     {
-        for
+        for(int i=0;i<arr.length;i++)
+        {
+        	if(arr[i]==key)
+        	{
+        		System.out.println("Element found at Index"+i);
+        		return;
+        	}
+        }
+        System.out.println("Element not found in the array");
+    }
+
+    public void Binarysearch(arr,element)
+    {
+    	while(l<=r)
+    	{
+    		
+    	}
     }
 }
 class Main{
     public static void main(String[] args) {
         Scanner sc=new Scanner(System.in);
-        do{
-        System.out.println("Enter the size of the array:");
-        n=sc.nextInt();
-        int arr[n];
-        for(int i=1;i,n;i++)
-        {
-            arr[i]=sc.nextInt();
-        }
+        int n;
+        int[] arr;
         System.out.println("MENU DRIVEN ARRAY SORT- SEARCH PROGRAM");
         System.out.println("ALGORITHM       -   Time Complexity");
         System.out.println("1.) Linear Search - O(n)");
@@ -25,15 +35,28 @@ public static void main(String[] args) {
         System.out.println("5.) Insertion Sort - O(n^2)");
         System.out.println("6.) Merge Sort - O(n logn)");
         System.out.println("7.) Radix sort - O(nk)");
-        
-        int choice;
-        
-        choice=sc.nextInt();
+        do{
+        System.out.println("Enter the size of the array:");
+        n=sc.nextInt();
+        arr=new int[n];
+        System.out.println("Enter"+n+"elements in an array:");        
+        for(int i=1;i,n;i++)
+        {
+            arr[i]=sc.nextInt();
+        }
+        int choice=sc.nextInt();
+        Search se = new Search();
         switch(choice)
         {
             case 1:
                 System.out.println("Searching Algorithm : Linear Search")
-                
+                System.out.println("Enter the Key to search:");
+                int key=sc.nextInt();
+                se.linearSearch(arr,key);
+
+             case 2:
+             System.out.println("Searching Algorithm : Binary Search")
+             
                 
         }
         
