Dear Arghya Das!
I think you can start learning matrixes with more high-level language - for
example Scilab or Octave.
Then you can switch to low-level languages - C/C++ (with Boost library) or
Fortran.
With best regards,
Norbert.
P.S. Of course this problem is out of topic. I recommend you
I guess you can use the operator % to index the columns. Look, if the
vector column is [A, B, C] address by [0, 1, 2], u can use index i+1%3. The
vector[2] goes to vector[0], vector[0] to vector[1] and vector [1] to
vector[2] automatically.
2015-05-08 18:32 GMT-04:00 Paul Anzel :
> Are you trying
Are you trying to cyclically permute the columns of a matrix? So for a
3x3 matrix of columns [A, B, C] you want [C, A, B]? Then you'd right
multiply (X_new = X*M) by a matrix M =
[0, 1, 0]
[0, 0, 1]
[1, 0, 0]
(generalizing to higher dimensions is trivial).
And yes, this is not a particularly debia
Il giorno Sat, 9 May 2015 01:21:44 +0530
Arghya Das ha scritto:
Hi Arghya,
(sorry for my bad english)
> Does anyone know how to rotate a 2d matrix circularly for 'n' times in
> suppose C language...? It would be a lot of help if you could explain
> with code.
I don't understand your expression
Does anyone know how to rotate a 2d matrix circularly for 'n' times in
suppose C language...? It would be a lot of help if you could explain with
code.
Hint : Each time each row vector needs to be rotated one element to the
right relative to the preceding row vector.
5 matches
Mail list logo
