Hi;
Please help me to solve my problem. There is an array of integers (tab[4][4]). I need to extract elements form this array (into a vector) in the following order:
a00, a11, a10, a11, a20, a11.
Thanks.
In my post I used array-like indexing (first digit row, second digit column). Sequential indexing is: a00, a05, a04, a05, a08, a05. Important is element a11 (here a05), because I construct vector with 6 elements and element a11 (a05) builds its second column.
I have to calculate lowest incremental sum of tab[4][4] elements to cross from tab[4][4] column 0 to 3. First column elements a00, a04, a08 have their path leading through element a05. That is why I am doing this.
Hi Andy
array looks like this:
1 > 2 > 3 > 4
\
5 > 6 7 8
/
9 > 10 11 12
13 14 15 16
now, I move from col 0 to 3, adding up array elements. Task is to find path, that constitutes the lowest sum possible. like 1 + 2 + 3 + 4 = 10. We move forward or forward-diagonal only.
1+6+3+4=14. I thought, vector might be helpful, to construct arrays like this
1 6
5 6
9 6,
then
1 6 7
5 6 7
9 6 7
to store all possible move patterns and
to solve the task.