java 二分查找及冒泡排序

class MyShort{

    public static void main(String [] args){
        int [] num = {5,4,6,2,1,7,9,8,10,3};
        myshort(num);
        p(num);
        findNum(num,6);
    }
    //二分查找
    public static void findNum(int [] num, int b){
        int low = 0;
        int higt = num.length - 1;
        int med;
        while(low < higt){
            med = (higt + low) / 2;
            if(b == num[med]){
                System.out.println("index is:" + med);
                return;
            }
            if(b > num[med]){
                low = med + 1;
            }
            if(b < num[med]){
                higt = med - 1;
            }
            if(low == higt){
                    med = (low + higt) / 2;
                    if(b == num[higt]){
                        System.out.println(" find index is:" + med);
                        return;
                    }
                }
            System.out.println(" not find");
        }


    }
    //冒泡排序
    public static void myshort(int[] num){
        for(int i = 1; i < num.length - 1; i++){
            for(int j = 0; j < num.length -1; j++){
                swapNum(num,j);
            }
        }

    }
    //
    public static void swapNum(int[] num, int n){
        int temp = 0;
            if(num[n] > num[n+1]){
                temp = num[n];
                num[n] = num[n+1];
                num[n+1] = temp;
            }
    }

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

}