Search this array for the integer 67 using this linear and binary search code.

Use an initializer list to generate the integer array

//********************************************************************

// Searching.java Author: Lewis/Loftus 10.12

//

// Demonstrates the linear search and binary search algorithms.

//********************************************************************

public class Searching

{

//-----------------------------------------------------------------

// Searches the specified array of objects for the target using

// a linear search. Returns a reference to the target object from

// the array if found, and null otherwise.

//-----------------------------------------------------------------

public static Comparable linearSearch(Comparable[] list,

Comparable target)

{

int index = 0;

boolean found = false;

while (!found && index

{

if (list[index].equals(target))

found = true;

else

index++;

}

if (found)

return list[index];

else

return null;

}

//-----------------------------------------------------------------

// Searches the specified array of objects for the target using

// a binary search. Assumes the array is already sorted in

// ascending order when it is passed in. Returns a reference to

// the target object from the array if found, and null otherwise.

//-----------------------------------------------------------------

public static Comparable binarySearch(Comparable[] list,

Comparable target)

{

int min=0, max=list.length, mid=0;

boolean found = false;

while (!found && min

{

mid = (min+max) / 2;

if (list[mid].equals(target))

found = true;

else

if (target.compareTo(list[mid])

max = mid-1;

else

min = mid+1;

}

if (found)

return list[mid];

else

return null;

}

}

Consider the following sorted array of integers: 0 12345 6 789 10 11 1213 14 10 12 18 22 31 34 40 4659 67 69 72 82 8498