1.三种排序,正序,混乱,倒序
List list = new LinkedList();
for ( int i = 0 ; i < 9 ; i ++ ) {
list.add( "a" + i);
}
//正序排列
Collections.sort(list);
System.out.println(list);
// 混乱的意思
Collections.shuffle(list);
System.out.println(list);
//倒序排列
Collections.reverse(list);
System.out.println(list);
// 折半查找
System.out.println(Collections.binarySearch(list, "a5" ));