题解 | #排序#(c++,maopaopaixv)

class Solution {
  public:
    vector<int> MySort(vector<int>& arr) {
        // write code here
        int len = arr.size();//length
        for (int i = 0; i < len; i++) {//n lun
            for (int j = i+1; j < len; j++) {//bi jiao
                if (arr[i] > arr[j]) {
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }
        }
        return arr;
    }
};