Traverse Matrix in adjacent diagonals

up vote
-1
down vote

favorite

I need to traverse a matrix on diagonals as in the following example.
I tried to adapt the code from Traverse Matrix in Diagonal strips but I didnt succed.

Its a matrix of ints: int M[n][n];

example to traverse

order of diagonals to traverse:

d(0)

d(+1)

d(-1)

d(+2)

d(-2)

d(+3)

d(-3)
and so on

lets take this example:

00 01 02 03

10 11 12 13

20 21 22 23

30 31 32 33

so the output required will be:

slice 1: 00 11 22 33

slice 2: 01 12 23

slice 3: 10 21 32

slice 4: 02 13

slice 5: 20 31

slice 6 : 03

slice 7: 30

asked Nov 11 at 20:40

Sabin Hantu

add a comment |

up vote
-1
down vote

favorite

I need to traverse a matrix on diagonals as in the following example.
I tried to adapt the code from Traverse Matrix in Diagonal strips but I didnt succed.

Its a matrix of ints: int M[n][n];

example to traverse

order of diagonals to traverse:

d(0)

d(+1)

d(-1)

d(+2)

d(-2)

d(+3)

d(-3)
and so on

lets take this example:

00 01 02 03

10 11 12 13

20 21 22 23

30 31 32 33

so the output required will be:

slice 1: 00 11 22 33

slice 2: 01 12 23

slice 3: 10 21 32

slice 4: 02 13

slice 5: 20 31

slice 6 : 03

slice 7: 30

asked Nov 11 at 20:40

Sabin Hantu

add a comment |

up vote
-1
down vote

favorite

I need to traverse a matrix on diagonals as in the following example.
I tried to adapt the code from Traverse Matrix in Diagonal strips but I didnt succed.

Its a matrix of ints: int M[n][n];

example to traverse

order of diagonals to traverse:

d(0)

d(+1)

d(-1)

d(+2)

d(-2)

d(+3)

d(-3)
and so on

lets take this example:

00 01 02 03

10 11 12 13

20 21 22 23

30 31 32 33

so the output required will be:

slice 1: 00 11 22 33

slice 2: 01 12 23

slice 3: 10 21 32

slice 4: 02 13

slice 5: 20 31

slice 6 : 03

slice 7: 30

asked Nov 11 at 20:40

Sabin Hantu

I need to traverse a matrix on diagonals as in the following example.
I tried to adapt the code from Traverse Matrix in Diagonal strips but I didnt succed.

Its a matrix of ints: int M[n][n];

example to traverse

order of diagonals to traverse:

d(0)

d(+1)

d(-1)

d(+2)

d(-2)

d(+3)

d(-3)
and so on

lets take this example:

00 01 02 03

10 11 12 13

20 21 22 23

30 31 32 33

so the output required will be:

slice 1: 00 11 22 33

slice 2: 01 12 23

slice 3: 10 21 32

slice 4: 02 13

slice 5: 20 31

slice 6 : 03

slice 7: 30

c algorithm matrix traversal diagonal

asked Nov 11 at 20:40

Sabin Hantu

asked Nov 11 at 20:40

Sabin Hantu

asked Nov 11 at 20:40

Sabin Hantu

asked Nov 11 at 20:40

Sabin Hantu

asked Nov 11 at 20:40

Sabin Hantu

add a comment |

1 Answer
1

active

oldest

votes

up vote
0
down vote

You could try the following code, replacing printf by whatever you want.

#define N 4



int M[N][N];

//populate the array

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

{

    printf("slice %d:", 2*i+1);

    for(int j=0; j<N-i; ++j)

        printf(" %d", M[j][j+i]);

    printf("n");

    if(i > 0)

    {

        printf("slice %d:", 2*i+2);

        for(int j=0; j<N-i; ++j)

            printf(" %d", M[j+i][j]);

        printf("n");

    }

}

answered Nov 11 at 21:18

Loïc France

1618

add a comment |

Your Answer

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});

}
});

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53253021%2ftraverse-matrix-in-adjacent-diagonals%23new-answer', 'question_page');
}
);

Post as a guest

Name

Required, but never shown

1 Answer
1

active

oldest

votes

1 Answer
1

active

oldest

votes

up vote
0
down vote

You could try the following code, replacing printf by whatever you want.

#define N 4



int M[N][N];

//populate the array

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

{

    printf("slice %d:", 2*i+1);

    for(int j=0; j<N-i; ++j)

        printf(" %d", M[j][j+i]);

    printf("n");

    if(i > 0)

    {

        printf("slice %d:", 2*i+2);

        for(int j=0; j<N-i; ++j)

            printf(" %d", M[j+i][j]);

        printf("n");

    }

}

answered Nov 11 at 21:18

Loïc France

1618

add a comment |

up vote
0
down vote

You could try the following code, replacing printf by whatever you want.

#define N 4



int M[N][N];

//populate the array

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

{

    printf("slice %d:", 2*i+1);

    for(int j=0; j<N-i; ++j)

        printf(" %d", M[j][j+i]);

    printf("n");

    if(i > 0)

    {

        printf("slice %d:", 2*i+2);

        for(int j=0; j<N-i; ++j)

            printf(" %d", M[j+i][j]);

        printf("n");

    }

}

answered Nov 11 at 21:18

Loïc France

1618

add a comment |

up vote
0
down vote

You could try the following code, replacing printf by whatever you want.

#define N 4



int M[N][N];

//populate the array

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

{

    printf("slice %d:", 2*i+1);

    for(int j=0; j<N-i; ++j)

        printf(" %d", M[j][j+i]);

    printf("n");

    if(i > 0)

    {

        printf("slice %d:", 2*i+2);

        for(int j=0; j<N-i; ++j)

            printf(" %d", M[j+i][j]);

        printf("n");

    }

}

answered Nov 11 at 21:18

Loïc France

1618

You could try the following code, replacing printf by whatever you want.

#define N 4



int M[N][N];

//populate the array

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

{

    printf("slice %d:", 2*i+1);

    for(int j=0; j<N-i; ++j)

        printf(" %d", M[j][j+i]);

    printf("n");

    if(i > 0)

    {

        printf("slice %d:", 2*i+2);

        for(int j=0; j<N-i; ++j)

            printf(" %d", M[j+i][j]);

        printf("n");

    }

}

answered Nov 11 at 21:18

Loïc France

1618

answered Nov 11 at 21:18

Loïc France

1618

answered Nov 11 at 21:18

Loïc France

1618

answered Nov 11 at 21:18

Loïc France

1618

add a comment |

draft saved

draft discarded

Thanks for contributing an answer to Stack Overflow!

Please be sure to answer the question. Provide details and share your research!

But avoid …

Asking for help, clarification, or responding to other answers.

Making statements based on opinion; back them up with references or personal experience.

To learn more, see our tips on writing great answers.

Some of your past answers have not been well-received, and you're in danger of being blocked from answering.

Please pay close attention to the following guidance:

Please be sure to answer the question. Provide details and share your research!

But avoid …

Asking for help, clarification, or responding to other answers.

Making statements based on opinion; back them up with references or personal experience.

To learn more, see our tips on writing great answers.

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Name

Required, but never shown

Name

Required, but never shown

This page is only for reference, If you need detailed information, please check here

搜尋此網誌

Ndtyjky