Implement 2 Searching algorithms, binary search
and linear search

1. Copy ALL files in this directory

2. Edit the file Search.java, implementing the methods

    public boolean BinarySearch(String [] S, String key, int low, int high)
    public boolean LinearSearch(String [] S, String key, int low, int high)

3. The searching algorithms are to be defined over
   arrays of String (for our convenience).

4. When you compare strings, use the method

        compareTo(String s1, String s2) 

   defined in the Search class. This is important, as when you do a comparison 
   it is counted, and we can then get a measure of the complexity of 
   your  algorithm.

5. Use the Test program to test out your methods. Note that
   Test reads in a file dictionary.data, places it in an array. To run

     > java Test

6. To work out what mark you get use Ex3a for BinarySearch and Ex3b for 
   LinearSearch;

7. To Submit:

     > cp Search.java ~/cs233lab/Search.java
     > cs233check

8. Deadline, Friday the 10th of December 1999, at 5 o'clock