冒牌排序及二分查找法

冒泡排序

    /**
     * 冒泡排序,,从小到大
     *
     * @param a
     * @return
     */
    public int[] sort(int a[]) {
        if (a == null) {
            throw new RuntimeException("入参错误");
        } else if (a.length == 1) {
            return a;
        }
        int count = a.length;
        for (int i = 0; i < count; i++) {
            for (int j = i + 1; j < count; j++) {
                if (a[i] > a[j]) {
                    int temp = a[i];
                    a[i] = a[j];
                    a[j] = temp;
                }
            }
        }
        return a;
    }

二分查找法：

  /**
     * 循环遍历
     *
     * @param a
     * @param target
     * @return
     */
    public int search(int a[], int target) {
        int start = 0;
        int end = a.length - 1;
        while (start &