package 测试Arrays排序功能的强大性能;
import java.util.Arrays;
public class Ceshi {
public static void main(String[] args) {
Employee[] employees = new Employee[3];
employees[0] = new Employee("lgq", 2309.98);
employees[1] = new Employee("zcp", 234232.8);
employees[2] = new Employee("wyl", 643.98);
System.out.println(Arrays.deepToString(employees));
Arrays.sort(employees);
System.out.println(Arrays.deepToString(employees));
}
}
class Employee implements Comparable<Employee> {
String name;
double salary;
public Employee(String name, double salary) {
this.name = name;
this.salary = salary;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public double getSalary() {
return salary;
}
public void setSalary(int salary) {
this.salary = salary;
}
public void raiseSalary(double byPercent) {
double raise = salary * byPercent / 100;
salary += raise;
}
@Override
public String toString() {
return "{" + this.name + ":" + this.salary + "}" ;
}
@Override
public int compareTo(Employee o) {
if (this.salary < o.salary) return -1;
if (this.salary > o.salary) return 1;
return 0;
}
}