public class BubbleSortTest { public static void main(String[] args) { int[] array = {4, 7, 8, 9, 3, 2, 1, 5}; bubbleSort(array); for(int i = 0; i < array.length; i++) System.out.print(array[i] + ", "); System.out.println(); System.out.println(binarySearch(array, 3)); } //冒泡排序算法,2011-4-24 19:58:38 public static void bubbleSort(int[] array) { for(int i = 1; i < array.length; i++) { for(int j = 0; j < array.length - i; j++) { if(array[j] > array[j + 1]) { int temp = array[j]; array[j] = array[j + 1]; array[j + 1] = temp; } } } } //二分法查找算法,2011-4-24 19:47:56 public static int binarySearch(int[] array, int value) { int low = 0; int high = array.length - 1; int middle; while(low <= high) { middle = (low + high) / 2; if(array[middle] == value) { return middle; } if(value < array[middle]) { high = middle - 1; } else { low = middle + 1; } } return -1; } }