冒泡排序+二分法

最近复习课本，看到了这两个简单的算法，就贴出来，冒泡和二分法很简单，不解释 。

import java.util.Scanner;

public class BubblesSortAlgorithm {

    @SuppressWarnings("resource")
    public static void main(String[] args) {
        int[] arrs = { 1, 23, 5, 2, 6, 3, 55, 9 };
        int i, j, temp = 0;
        for (i = arrs.length - 1; i > 0; i--) {
            for (j = 0; j < i; j++) {
                if (arrs[i] < arrs[j]) {
                    temp = arrs[i];
                    arrs[i] = arrs[j];
                    arrs[j] = temp;
                }
            }
        }

        System.out.println("排序后的数组是:");
        for (i = 0; i < arrs.length; i++) {
            System.out.print(" " + arrs[i]);
        }

        int index = -1, mid = 0, begin = 0, end = arrs.length;
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();

        while (begin <= end) {
            mid = (begin + end) / 2;
            //System.out.println(mid);
            if (arrs[mid] == num) {
                index = mid;
                break;
            } else if (arrs[mid] < num) {
                begin = mid + 1;
            } else if (arrs[mid] > num) {
                end = mid - 1;
            }
        }
        if (index == -1) {
            System.out.println("数字" + num + "不存在");
        } else {
            System.out.println("数字" + num + "在数组中的位置是" + index);
            
        }
    }
}