Question

QUESTION 5: Write a C++ function called layers which takes an NxN integer array (for some constant N) and populates the entries 0..N²-1 as follows:

• The upper left entry (row-0, col-0) is 0.
• Subsequent numbers are assigned along Southwest-to-Northeast diagonals, layer-by-layer.

For example, if N=4, your function would result in the following assignment to entries in the array:

0	2	5	9
1	4	8	12
3	7	11	14
6	10	13	15

(the individual “layers” are shown by alternating shading).

#define N 10     // or some other number... // your function here void layers(int a[][N]) { }

Answer 1

Here is the completed code for this problem. Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. If you are satisfied with the solution, please rate the answer. Thanks

//Code

#include<iostream>

#include<iomanip>

#define N 10     // or some other number...

using namespace std;

// your function here

void layers(int a[][N]) {

              int n=0; //current number to assign

              int row=0; //current row

              int col=0; //current column

              int total=N*N; //total number of cells/locations

              //looping until all locations have been filled

              while(n<total){

                           //copying value of col and row to two temporary variables

                           int c=col;

                           int r=row;

                           //as long as r and c are valid, looping.

                           while(r>=0 && c<N){

                                         //adding n to location pointed by row r and column c

                                         a[r][c]=n;

                                         //increasing n to assign next number

                                         n++;

                                         //moving up

                                         r--;

                                         //moving right

                                         c++;

                           }

                           //if there is a row to complete, incrementing row

                           if(row<N-1){

                                         row++;

                           }else{

                                         //if row is last row, increasing col

                                         col++;

                           }

                          

              }

}

int main(){

              //creating an N*N array, layering it and displaying it

              int array[N][N];

              layers(array);

             

              for(int i=0;i<N;i++){

                           for(int j=0;j<N;j++){

                                         cout<<setw(3)<<array[i][j]<<" ";

                           }

                           cout<<endl;

              }

             

              return 0;

}

/*OUTPUT for N=10*/