手写排序算法－－冒泡，快排，二分

/** 冒泡 */
public static void bober(int[] array){
    int length = array.length;
    for(int i=0;iarray[j+1]){
                int temp = array[j];
                array[j] = array[j+1];
                array[j+1] = temp;
            }
        }
    }
}

/** 快排 */
public static void quickSort(int[] array,int left,int right){
    if(array==null){
        return;
    }
    int length = array.length;
    if(length == right){ // 防止输入数组的非下标长度，造成越界
        right = right -1;
    }
    if(left > right){
        return;
    }
    int low = left;
    int hight = right;
    int key = array[left];

    while(low=key){
            hight --;
        }
        array[low] = array[hight];
        while(low array[middle]){
            low = middle + 1;
        }
        if(value < array[middle]){
            high = middle - 1;
        }
    }
    return -1;
}