How can I calculate the computaional complexity of Frobenius norm of each column vector(M X 1) in a M X N matrix and finally sorting the norm values in descending order? To clarify I have N-column vectors in a matrix and I want to calculate the magnitude of each column and finally arranging in a descending order in an algorithm. So what will be the computational complexity of doing this task in a a Big-O notation?