Java实现二分查找的递归算法

public class BinarySearch {int[] list = {3, 5, 8, 11, 46, 51, 60, 61, 67, 71, 80};public static void main(String[] args) {BinarySearch bs = new BinarySearch();int i = bs.binarySearch(46);if (i >= 0) {System.out.println(i);} else {System.out.println("不存在！");}}public int binarySearch(int key) {int low = 0;int high = list.length - 1;while (high >= low) {int mid = (low + high) / 2;if (key < list[mid]) high = mid - 1;else if (key == list[mid]) return mid;else low = mid + 1;}return -1;}}