c - Not displaying correctly transpose of matrix? -


it works fine quadratic matrix (2x2 or 3x3) 2x3 or 3x2 doesn't display correctly!! 

#include <stdio.h>  int main() { int i,j,k,c1,c2,l1,l2; int m1[10][10],m2[10][10],transposta[10][10],multiplicacao[10][10];  printf("\ndigite o numero de linhas e colunas na primeira matriz\n");         scanf("%d%d",&l1,&c1);         printf("\ndigite os elementos da matriz:\n");         for(i=0;i<l1;i++)         {             for(j=0;j<c1;j++)             {                 scanf("%d",&m1[i][j]);             }         }         for(i=0;i<l1;i++)         {             for(j=0;j<c1;j++)             {                 transposta[j][i] = m1[i][j];             }         }         printf("\na matriz transposta e:\n");         for(i=0;i<l1;i++)         {             for(j=0;j<c1;j++)                 printf("%d\t",transposta[i][j]);             printf("\n");         }

if put elements {1,2,3,4,5,6} in 2x3 matrix, displays this:

1 4 1

2 5 0

however correct way be:

1 4

2 5

3 6

what wrong code , why doesn't work when number of rows different columns

everything correct in code, change 

for(i=0;i<l1;i++)         {             for(j=0;j<c1;j++)                 printf("%d\t",transposta[i][j]);             printf("\n");         }

by

for(i=0;i<c1;i++)         {             for(j=0;j<l1;j++)                 printf("%d\t",transposta[i][j]);             printf("\n");         }

for printing purpose, have take care of c1 , l1


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more