fibonacci数列递归和非递归实现
?
public static int search(Integer[] data, int number) {int low;int high;int mid;if (data == null)return -1;low = 0;high = data.length - 1;while (low <= high) {mid = (low + high) / 2;if (number < data[mid]) {high = mid - 1;} else if (number > data[mid]) {low = mid + 1;} else if (number == data[mid]) {return mid;}}return -1;}