摘要: 1 /* 2 * 二分查找算法 3 */ 4 public class BinarySerach { 5 public static int binarySearch(int[] list, int key) { 6 int low = 0; 7 int high = list.length - 1; 8 while (... 阅读全文
posted @ 2016-08-10 10:26 lucky&apple 阅读(152) 评论(0) 推荐(0) 编辑