Lintcode：整数排列

[3, 2, 1, 4, 5]

[1, 2, 3, 4, 5]

class Solution:
"""
@param: A: an integer array
@return:
"""
def sortIntegers(self, A):
# write your code here
for i in range(len(A)):
for j in range(len(A)-i-1):
if A[i] >= A[i+j+1]:
A[i], A[i+j+1] = A[i+j+1], A[i]
return A

class Solution {
public:
/*
* @param A: an integer array
* @return:
*/
void sortIntegers(vector<int> &A) {
// write your code here
for(int i = 0; i < A.size(); i++)
{
for(int j = i + 1; j < A.size(); j++)
{
if(A[i] > A[j])
swap(A[i], A[j]);
}
}
}
};