int main(int argc, char * argv[])
{
// Create maze as a 2D array
uint8_t maze[MAX_ROWS][MAX_COLS];

// Check if program was called properly
if (argc != 3)
{
std::cout << "Invalid usage of file." << std::endl;
std::cout << "Proper usage: maze nRows, nCols" << std::endl;
return 1;
}
int nr = atoi(argv[1]);
int nc = atoi(argv[2]);

// Generate maze
generateMaze(maze, nr, nc);

// Check if there is a path
if (findPath(maze, nr, nc))
{
std::cout << "Maze solved." << std::endl;
}
else
{
std::cout << "Maze can't be solved." << std::endl;
}

// print the maze in ps file
printMaze(maze, nr, nc);
return 0;
}

// encode row, color and direction to a number
int encode(int r, int c, int d, int nr, int nc)
{
return c + nc * (r + nr * d);
}

// decode number to row, column, direction
void decode(int * r, int * c, int * d, int nr, int nc, int value)
{
*c = value % nc;
value /= nc;
*r = value % nr;
*d = value / nr;
}

// check if the wall of the cell exists
bool wallExist(uint8_t maze[][MAX_COLS], int value, int nr, int nc)
{
bool exist = true;
int r, c, d;
decode(&r, &c, &d, nr, nc, value);
if ((maze[r][c] & walls[d]) == 0)
{
exist = false;
}
return exist;
}

// check if wall is exterior
bool exteriorWall(int value, int nr, int nc)
{
int r, c, d;
decode(&r, &c, &d, nr, nc, value);
return ((r == 0) && (d == 0)) ||
((r == nr - 1) && (d == 3)) ||
((c == 0) && (d > 3)) ||
((c == nc - 1) && (d > 0) && (d < 3)) ||
((r == 0) && ((c % 2) == 0) && ((d == 1) || (d == 5))) ||
((r == nr - 1) && ((c % 2) == 1) && ((d == 2) || (d == 4)));
}

// get the adjacent cell in direction
void getAdjacentCell(int r, int c, int d, int * adjr, int * adjc)
{
switch (d)
{
case 0:
*adjr = r - 1;
*adjc = c;
break;
case 1:
*adjr = r;
if ((c % 2) == 0)
{
(*adjr)--;
}
*adjc = c + 1;
break;
case 2:
*adjr = r + 1;
if ((c % 2) == 0)
{
(*adjr)--;
}
*adjc = c + 1;
break;
case 3:
*adjr = r + 1;
*adjc = c;
break;
case 4:
*adjr = r + 1;
if ((c % 2) == 0)
{
(*adjr)--;
}
*adjc = c - 1;
break;
case 5:
*adjr = r;
if ((c % 2) == 0)
{
(*adjr)--;
}
*adjc = c - 1;
break;
}

Q2 Matrix transpose: m2[i][j] = m1[j][i], i=0,â€¦.,n-1, j=0,â€¦,n...