public class OrderedArray { //有序数组的二分查找; public int find(int arr[],int key){ int lowerBound = 0; int upperBound = arr.length - 1; int curIn; while(true){ curIn = (lowerBound + upperBound)/2; if(arr[curIn] == key){//找到了 return cur... Read More
posted @ 2013-01-24 11:22
tangrongyue
Views(257)
Comments(0)
Diggs(0)

浙公网安备 33010602011771号