Question

      Searching an array:   
                                                                          
      --Using the template provided, create a method called search
      that takes an int and an array as parameters.  The method search
      should traverse the array to look for the int.
         
      search should print whether it found the int or not,   
      for example:   
      found: 10   
      did not find: 11   

      

examples

(bold face is text entered by user) % java SearchArray 20 found: 20 % java SearchArray 13 did not find: 13 % java SearchArray 100 found: 100 % java SearchArray 23 did not find: 23

Template:

import java.util.Scanner;

public class SearchArray {

public static int search(int x, int[] arr){

/* insert your code for search function here */

}

public static void main (String[] args) {

//create an array of ints

int [] aa =

{0,1,4,6,8,9,10,12,14,15,16,18,20,21,22,24,25,26,27,28,29,30,31,32,33,34,35,36,37,3

8,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,

66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93

,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,

116,117,118,119,120,121,122,123,124,125,126,127};

Scanner input = new Scanner(System.in);

int x = input.nextInt();

search(x,aa);

}

}

Answer 1

import java.util.Scanner;

public class SearchArray {

    public static int search(int num, int[] array) {
        int low = 0;
        int high = array.length - 1;
        int mid;

        while (high >= low) {
            mid = (low + high) / 2;
            if (num < array[mid])
                high = mid - 1;
            else
            if (num == array[mid])
                return mid;
            else
                low = mid + 1;
        }
        return - 1;
    }


    public static void main (String[] args) {
        //create an array of ints
        int [] aa =
                {0,1,4,6,8,9,10,12,14,15,16,18,20,21,22,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,
                39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,
                66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,
                94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,
                116,117,118,119,120,121,122,123,124,125,126,127};

        Scanner input = new Scanner(System.in);
        int x = input.nextInt();
        int res = search(x,aa);
        if(res==-1){
            System.out.println("did not find: "+x);
        }
        else{
            System.out.println("found: "+x);
        }
    }

}