The above code chunk transposes each element twice and hence u getting the same matrix finally. The approach should be go for either upper trianular elements or lower ones for transposing.

Also, this will give you better preformance numbers from square(n) to n*(n-1)/2 :))

Hope u remember me ..

+Abhishek

You can imagine my embarrassment when I discovered the problem…

Here is the updated version:

    /** Transpose the matrix. **/
    void transpose() {
      for (int r = 0; r < dim; r++) {
        for (int c = r + 1; c < dim; c++) {
          T tmp = getElem(r, c);
          setElem(r, c, getElem(c, r));
          setElem(c, r, tmp);
        }
      }
    }