线性和二进制搜索Java

我想产生执行线性搜索和二进制搜索需要多长时间的输出。我的代码在下面给出，当我运行它时给出了这个错误。“ java.lang.ClassCastException：无法将java.lang.String强制转换为Employee”

import java.util.*;
import java.util.Collections;
public class H275{public static void main (String[] args){while (JPL.test()){ 
  Employee[] employees = new Employee[1000000];  
  for (int i = 0, numv = employees.length; i < employees.length; numv = employees.length - ++i)
  {String num = Integer.toString(numv);
    switch (i % 3)
    {case 0 : employees[i] = new Secretary("NameA" + num, "America" + num,
                                           1000.0 * numv); 
    break;
      case 1 : employees[i] = new Manager("NameB" + num, "Australia" + num,
                                          2000.0 * numv);  
      break;
      case 2 : employees[i] = new Salesman("NameC" + num,"Brazil" + num,
                                           1500.0 * numv, 200.0 * numv);
    }
  }
  for (Employee e : employees)  
    e.raise();
  for (Employee.SortType s : Employee.SortType.values())
  {employees[0].setSort(s);
    long startTime = System.nanoTime();
    Arrays.sort(employees);
    long endTime = System.nanoTime();

  }
  employees[0].setSort(Employee.SortType.NAMESORT);
  Arrays.sort(employees);
  String name;
  int count = 0;


 Employee e1;
 for (int i = 0, numv = employees.length; i < employees.length; numv = employees.length - ++i)
  {
   String num = Integer.toString(numv);
   switch (i % 3)
    {case 0 : e1 = new Secretary("NameA" + num, "America" + num,
                                           1000.0 * numv); 
    break;
      case 1 : e1 = new Manager("NameB" + num, "Australia" + num,
                                          2000.0 * numv);  
      break;
      case 2 : e1 = new Salesman("NameC" + num,"Brazil" + num,
                                           1500.0 * numv, 200.0 * numv);
    }
  }



  long startTime = System.nanoTime();
  for (int e = 0; e < employees.length; e += 10000)
  {
    name = employees[e].getName();
    count++;
    if(employees[e].getName().equals(name))
    {

      break;
    }
  }
  long endTime = System.nanoTime();

  System.out.println("\nAverage Elapsed LinearSearch time = " + (endTime - startTime) / (1000000.0 * count) + " milliseconds");
  startTime = System.nanoTime();
  for (int e = 0; e < employees.length; e += 10000)


  {
    String name2 = employees[e].getName();

   Arrays.binarySearch(employees,name2); 


    endTime = System.nanoTime();
    break;
  }

  System.out.println("\nAverage Elapsed BinarySearch time = " + (endTime - startTime) / (1000000.0 * count) + " milliseconds");
}}}


abstract class Employee implements Comparable<Employee>
{
  private String name;
  private String address;
  protected double salary;
  public enum SortType{NAMESORT,ADDRESSSORT,JOBSORT,SALARYSORT};
  static private SortType sortType;
  public Employee(String nm, String add, double sal)
  {
   name=nm;
   address=add;
   salary=sal;
  }
  public abstract double raise();

  public String getName()
  {
   return name; 
  }
  public SortType setSort(SortType sortType)
  {
    return sortType;
  }
  public int compareTo(Employee e)
  {
    return 0;
  }
  public String toString()
  {
    return "hello";

  }
}
class Secretary extends Employee
{
 public Secretary(String name, String add, double sal)
 {
  super(name,add,sal); 
 }
 public double raise()
 {
  return salary; 
 } 

}

class Salesman extends Employee
{
  private double commission;
 public Salesman(String name,String address, double salary, double comm)
 {
   super(name,address,salary);
   commission=comm;
 }
 public double raise()
 {
  return salary+commission; 
 }
 public String toString()
 {

   return "test";
 }

}
class Manager extends Employee
{
  public Manager(String name,String address, double salary)
 {
   super(name,address,salary);
 }
  public double raise()
  {
   return salary+(0.05*salary); 

  }

}