List和Treemap排序实例及效率对比

package test; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.Date; import java.util.List; /** * @title: SortListTest.java * @package test * @description: TODO * @copyright: Java MobileGame Team(c) * @author xj * @date 2014-8-12 */ public class SortListTest { public static void main(String[] args){ List<User> list = new ArrayList<User>(); User[] userArray = new User[1000000]; for (int i = 0; i < 1000000; i++) { userArray[i] = new User(i,i,"anonymous"); } Date date1 = new Date(); for (User user: userArray){ list.add(user); } // for(User user : list){ // System.out.println(user.getId()); // } Collections.sort(list, new Comparator<User>() { public int compare(User user1, User user2) { return user2.getAge().compareTo(user1.getAge()); } }); System.out.println("-----------------排序后----------------"); // for(User user : list){ // System.out.println(user.getId()); // } Date date2 = new Date(); System.out.println(date2.getTime()-date1.getTime()); } } class User { public User(int id, int age, String name) { this.id = id; this.age = age; this.name = name; } private int id; private int age; private String name; public Integer getId() { return id; } public void setId(int id) { this.id = id; } public Integer getAge() { return age; } public void setAge(int age) { this.age = age; } public String getName() { return name; } public void setName(String name) { this.name = name; } }