java实现 二分法 插入排序

import java.util.ArrayList;import java.util.Arrays;import java.util.List;import java.util.ListIterator;/** * TODO(这里用一句话描述这个类的作用) * <p> * TODO * @author    * @Date 2012-9-9   */public class BinarySearch2 {public static int binanrySearch(List<Integer> list, int key) {int low = 0;int height = list.size() - 1;while (low <= height) {// 位运算提高效率int mid = (low + height) >>> 1;//System.out.println(mid);Integer midal = list.get(mid);//System.out.println(midal);//与key比较 比key大 返回1  否则返回-1 相等返回0int copInt = midal.compareTo(key);//System.out.println(copInt);if (copInt < 0) {low = mid + 1;} else if (copInt > 0) {height = mid - 1;} else {//System.out.println(mid);return mid; // found key}}//System.out.println(-(low + 1));return -(low + 1);// not found key}public static List<Integer> insertSort(List<Integer> list) {//装换成数组排序Integer[] arry = list.toArray(new Integer[0]);//System.out.println(arry.length);for (int i = 0; i < arry.length; i++) {for (int j = i; j > 0 && arry[j - 1] > arry[j]; j--) {swap(arry, j, j - 1);}}//System.out.println(Arrays.toString(arry));//利用ListIterator 还是按照排序的顺序放入list中ListIterator<Integer> i = list.listIterator();for (int j = 0; j < arry.length; j++) {i.next();i.set(arry[j]);}return list;}public static void swap(Integer[] arry, int j, int i) {int t = arry[j];arry[j] = arry[i];arry[i] = t;}public static void main(String[] args) {List<Integer> list = new ArrayList<Integer>();list.add(1);list.add(2);list.add(4);list.add(3);list.add(9);list.add(8);list.add(6);insertSort(list);System.out.println(Arrays.toString(list.toArray()));//Collections 中的排序//Collections.sort(list);//System.out.println(Arrays.toString(list.toArray()));//System.out.println(Collections.binarySearch(list, 6));binanrySearch(list, 4);}}