二分法查找

package com.test;


import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;


public class ErFenMethodFind01 {


static int a1, a2, a3, low, high, middle;


public static void main(String[] args) {
int[] array = new int[] { 2, 45, 3, 3, 3, 3, 3, 456, 57, 678, 6789, 76,
45, 23, 2, 123, 2354, 5 };
Random rand = new Random();
for (int i = 0; i < 13; i++) {
}
Arrays.sort(array);
for (int i = 0; i < 13; i++) {
System.out.print(array[i] + "\t");
}
Scanner scan = new Scanner(System.in);
System.out.println("\ninput a number in array:");
int a = scan.nextInt();
fx(array, a);
}


private static void fx(int[] array, int a) {
low = 0;
high = array.length - 1;
middle = (low + high) / 2;
while (high >= low) {
middle = (low + high) / 2;
if (array[middle] > a)
high = middle - 1;
else if (array[middle] < a)
low = middle + 1;
else {
System.out.println("index:   1   " + middle);
while (middle - 1 >= 0 && array[middle - 1] == a) {
--middle;
System.out.println("index:   2   " + (middle));
}
middle = (low + high) / 2;
while ((middle + 1 <= array.length - 1)
&& array[middle + 1] == a) {
++middle;
System.out.println("index:   3   " + (middle));
}
break;
}
}
if (low == high && array[low] != a)
System.out.println("not find");
}


}