Question

Fill an array (type int, size n).

Perform Linear Search; Binary Search.

Answer 1

import java.util.Scanner;
import java.util.Arrays;
public class EasySearch 
{
    public static void main(String[] args) 
    {
        Scanner sc = new Scanner(System.in);        
        System.out.print("Enter size n: ");
        int n = sc.nextInt();
        int R[] = new int[n];        
        System.out.println("Enter elements:");
        for (int i = 0; i < n; i++) 
        {
            R[i] = sc.nextInt();
        }        
        System.out.print("Enter target to search: ");
        int target = sc.nextInt();        
        int li = -1;
        for (int i = 0; i < n; i++) 
        {
            if (R[i] == target) 
            {
                li = i;
                break;
            }
        }
        System.out.println("Linear Search Index: " + li);        
        int low = 0, high = n - 1, bi = -1;        
        while (low <= high)
        {
            int mid = (low + high) / 2;
            if (R[mid] == target) 
            {
                bi = mid;
                break;
            } 
            else if (R[mid] < target) 
            {
                low = mid + 1;
            } 
            else 
            {
                high = mid - 1;
            }
        }
        System.out.println("Binary Search Index (after sorting): " + bi);
    }
}

Output:

Enter size n : 5 

Enter elements : 

85 12 44 60 37

Enter target to search : 60

Linear Search Index : 3 Binary Search Index