lintcode:整数排序

public class Solution {
/**
* @param A an integer array
* @return void
*/
public void sortIntegers(int[] A) {
// Write your code here
if(A==null || A.length<=1)
return;
int n = A.length;
for(int i=n-1;i>=0;i--){

for(int j=0;j<i;j++){
if(A[j]>A[j+1]){
swap(A,j,j+1);
}
}
}
}
public void swap(int[] A,int i,int j){
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}