java£º¶þ·Ö²éÕÒ·¨

package arrays.compara;
/**
 *
 * @author Happy ¶þ·Ö²éÕÒ·¨
 */
public class BinarySearch {
 public static void main(String[] args) {
  int[] arrInt = { 2, 34, 32, 24, 23, 34, 12, 3, 4, 2 };
  int index = bSearch(29, arrInt, 0, arrInt.length);
  System.out.println("Index : " + index);
  /*
   * for (int i : arrInt) { System.out.println(i); }
   */
 }
 // js¶þ·Ö²éÕÒ·¨£¨Ã»Óгɹ¦£©
 private static int bSerarch(int[] arrInt, int value) {
  int startIndex = 0, stopIndex = arrInt.length - 1, middle = (int) (Math
    .floor((stopIndex + startIndex) / 2));
  while (arrInt[middle] != value && startIndex < stopIndex) {
   // adjust search area£¨µ÷Õû²éÕÒ·¶Î§£©
   if (value < arrInt[middle]) {
    stopIndex = middle - 1;
   } else if (value > arrInt[middle]) {
    startIndex = middle + 1;
   }
   // recalculate middle£¨ÖØмÆËãÖÐÏîË÷Òý£©
   middle = (int) Math.floor((stopIndex + startIndex) / 2);
  }
  // make sure it's the right value£¨È·±£·µ»ØÕýÈ·µÄÖµ£©
  return (arrInt[middle] != value) ? -1 : middle;
 }
 // java¶þ·Ö²éÕÒ·¨
 private static void bSearch(int[] arrInt, int seek) {
  // Òª²éÕÒµÄÖµ
  // int seek = 33;
  // ÀàËÆÓÚÖ¸ÕëµÄ¶«Î÷
  int index = 0;
  // ²éÕÒÆðʼϱê
  int start = 0;
  // ²éÕÒ½áÊøϱê
  int end = arrInt.length - 1;
  // ¼ÆÊýÆ÷
  int count = 0;
  while (true) {
   count++;
   // ³õʼ»¯Êý×éÖмäÖµµÄϱê
   // Ô­À´Îªindex = (start + end) / 2;µ±start + endµÄÖµ³¬¹ýÁË×î´óµÄÕýintÖµµÄʱºò, index
   // »á±ä³É¸ºÖµ,Õâ¸öʱºò¾Í»áÅ׳öÒì³£