gistfile1.txt

for i in [0..vec.len]:
  vec[i] = vec[i] * vec[i]
return sorted(vec)

This is what I got so far:

class Solution {
public:
vector sortedSquares(vector& A) {
for (unsigned int i = 0; i < A.size(); i++)
A[i] = A[i] * A[i];

    int temp = 0;
    
    for (unsigned int i = 0; i < A.size() - 1; i++)
    {    
        for (unsigned int j = 0; j < A.size()-i-1; j++)  
            if (A[j] > A[j+1])  
            {
                int temp = A[j];
                A[j] = A[j+1];
                A[j+1] = temp;
            }

    }
    return A;
}

};