二分查找,数组逆序,冒泡排序法(Java实现)

1. 二分查找

import java.util.Scanner;

 public class Test {
   
     public static void main(String[] args) {
   
         int [] arr = {
   1,2,3,4,5,6,7,8,9};
         Scanner scanner = new Scanner(System.in);
         System.out.println("请输入要查找的数");
         int toFind = scanner.nextInt();
         int num = binarySearch(arr,toFind);
         System.out.