Lösungsvorschlag

Hier ist ein Lösungsvorschlag zur letzten Aufgabe:

#include <cstddef> /* needed for std::size_t */
#include <cstdio> /* needed for std::printf */
#include <utility> /* needed for std::swap */

struct Matrix {
   std::size_t m; /* number of rows */
   std::size_t n; /* number of columns */
   std::size_t incRow;
   std::size_t incCol;
   double* data;

   void init() {
      for (std::size_t i = 0; i < m; ++i) {
         for (std::size_t j = 0; j < n; ++j) {
            data[i*incRow + j*incCol] = j * n + i + 1;
         }
      }
   }

   void print() {
      for (std::size_t i = 0; i < m; ++i) {
         std::printf("  ");
         for (std::size_t j = 0; j < n; ++j) {
            std::printf(" %4.1lf", data[i*incRow + j*incCol]);
         }
         std::printf("\n");
      }
   }
};

void transpose(Matrix& A) {
   std::swap(A.m, A.n);
   std::swap(A.incRow, A.incCol);
}

int main() {
   Matrix A;
   A.m = 7; A.n = 8;
   A.data = new double[A.m * A.n];
   A.incRow = 1; A.incCol = 7;
   A.init();
   std::printf("A =\n"); A.print();
   transpose(A);
   std::printf("A^T =\n"); A.print();
}