16 二分查找

1 二分查找法思想

2 二分查找法的代码实现

package search;

import java.util.Arrays;

/**
 * @author Andy
 * @email andy.gsq@qq.com
 * @date 2023/2/17 21:43:39
 * @desc 二分查找
 */

public class BinarySearchForJava {
  public static void main(String[] args) {
    int arr[] = { 1, 8, 10, 89,1000,1000, 1234 };
    int findVal = 8;

    int index = binarySearch(arr,0,arr.length - 1, findVal);
    System.out.print("查询的数组为: ");
    show(arr);
    System.out.println("查询的数为: " + findVal);
    System.out.println("查询的位置为: " + index);
  }

  /**
   * 二分查找算法
   * @param arr
   * @param left
   * @param right
   * @param findVal
   * @return
   */
  public static int binarySearch(int[] arr, int left, int right, int findVal) {
    if(left > right || findVal < arr[0] || findVal > arr[arr.length - 1]){
      return -1;
    }

    int mid = (left + right) / 2;
    int midVal = arr[mid];
    if(midVal > findVal){
      return binarySearch(arr, left, mid - 1, findVal);
    } else if (midVal < findVal) {
      return binarySearch(arr, mid + 1, right, findVal);
    }else {
      return mid;
    }
  }

  public static void show(int[] arr) {
    for (int i = 0; i < arr.length; i++) {
      System.out.print(arr[i] + " ");
    }
    System.out.println();
  }
}