CECS 277
LAB ASSIGNMENT #6
Assigned date: 2/29
Due date: 3/7
10 points

Implement a generic binanry search program with the following requirements:

• Create a BinarySearcher for executing binary searches through an array. Finds a value in a sorted array, using the binary search algorithm.  The binary search method has one parameter (the value to search) and returns the index at which the value occurs, or -1 if it does not occur in the array. The class BinarySearcher has a private data member as an array, a constructor, and the binary search method.
• Create a class called InsertionSort. The class has a static method that will sort the passing array as an argument using a insertion sort algorithm. The sort method should be able to sort any objects in ascending or descending order.
• Write a test driver to search the following:
  • An faculty object. Initialize an array of faculty objects.
  • An integer number. A set of integer numbers is entered from the user.

/**
A class for executing binary searches through an array.
*/
public class BinarySearcher
{
private int[] a;

/**
Constructs a BinarySearcher.
@param anArray a sorted array
*/
public BinarySearcher(int[] anArray)
{
a = anArray;
}

/**
Finds a value in a sorted array, using the binary
search algorithm.
@param v the value to search
@return the index at which the value occurs, or -1
if it does not occur in the array
*/
public int search(int v)
{
int low = 0;
int high = a.length - 1;
while (low <= high)
{
int mid = (low + high) / 2;
int diff = a[mid] - v;

if (diff == 0) // a[mid] == v
return mid;
else if (diff < 0) // a[mid] < v
low = mid + 1;
else
high = mid - 1;
}
return -1;
}
}

GRADING

• Demonstrate the lab assignment to the instructor in the lab.
• Be ready to demonstrate the result and answer some questions about the lab assignment.