java 代码
- public class BinarySearch {
- public static int search(int element, int[] sortedArray) {
- int length = sortedArray.length;
- int left = 0;
- int right = length - 1;
- while (left <= right) {
- int mid = (left + right) / 2;
- if (sortedArray[mid]==element) {
- return mid;
- } else if (sortedArray[mid] > element) {
- right = mid - 1;
- } else {
- left = mid + 1;
- }
- }
- return -1;
- }
- public static void main(String[] args) {
- int[] array = {1, 2, 3, 4, 5, 6, 7};
- System.out.println(search(2, array));
- }
- }