LintCode 463-整数排序

public class Solution {
    /**
     * @param A: an integer array
     * @return: nothing
     */
    public void sortIntegers(int[] A) {
        //这里使用冒泡排序
        for (int i = 0; i < A.length; i++) {
            for (int j = i; j < A.length-1; j++) {
                if(A[i]> A[j+1]){
                    int temp = A[i];
                    A[i] = A[j+1];
                    A[j+1] = temp;
                }
            }
        }
    }
}