This class is designed to test the efficiency of the two search models.
You will simultaneously populate both arrays with the same random numbers. This will guarantee that both arrays have the exact same content. Sort only ONE array using Arrays.sort. This sorted array will be used with the bin_search method and the unsorted array will be used with seq_search.
Write code to read integers from System.in until EOF. With each integer search each array using seq_search and bin_search. Report the number of elements examined for each search method, whether or not the item was found and where in the array you found it.
The number of array elements examined is stored in static instance variables. These variables for sequential and binary search are SEQ_NUM and BIN_NUM respectively. The appropriate variable is set when the corresponding search method is called.
public class P10Class
{
public static int SEQ_NUM;
public static int BIN_NUM;
public static int seq_search(int[] data, int key)
{
boolean found = false;
int i = 0;
SEQ_NUM = 0;
while ( !found && (i < data.length) )
{
if ( data[i] == key )
found = true;
else
i++;
SEQ_NUM++;
}
if ( found )
return i;
else
return -1;
}
public static int bin_search(int[] data, int key)
{
boolean found = false;
int midpoint = 0, first = 0, last;
BIN_NUM = 0;
last = data.length - 1;
while ( ( first <= last ) && !found )
{
midpoint = (first + last) / 2;
if ( data[midpoint] == key )
found = true;
else if ( data[midpoint] > key )
last = midpoint - 1;
else
first = midpoint + 1;
BIN_NUM++;
}
if ( found )
return midpoint;
else
return -1;
}
}
