forked from Aanchalgupta12/AdditionOfTwoSparseMatrices
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathabc
More file actions
82 lines (82 loc) · 1.97 KB
/
Copy pathabc
File metadata and controls
82 lines (82 loc) · 1.97 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/****************Vetor Represetation Of A General Sparse Matrix****************/
/****************************Author: Aanchal Gupta*****************************/
/******************************************************************************/
#include<stdio.h>
int rep(int m,int n,int M[m][n])
{
int i,j,k=0;
int N[10][3];
int x,y,z,l=0;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(M[i][j]!=0)
{
N[k][0]=i;
N[k][1]=j;
N[k][2]=M[i][j];
k++;
l++;
}
}
}
for(i=0;i<k;i++)
{
for(j=0;j<3;j++)
{
printf("%d\t",N[i][j]);
}
printf("\n");
}
}
int rep2(int m,int n,int M[m][n])
{
int i,j,k=0;
int N[10][3];
int x,y,z,l=0;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(M[i][j]!=0)
{
N[k][0]=i;
N[k][1]=j;
N[k][2]=M[i][j];
k++;
l++;
}
}
}
for(i=0;i<k;i++)
{
for(j=0;j<3;j++)
{
printf("%d\t",N[i][j]);
}
printf("\n");
}
}
/**********************************************************************************/
void main()
{
int m=3;
int n=3;
int B[m][n];
int M[3][3]={{1,0,0},{0,6,7},{0,0,0}};
rep(m,n,M);
int k[3][3]={{1,0,0},{0,6,7},{0,0,0}};
rep2(m,n,k);
}
/**********************************************************************************/
/**********************************************************************************
ALGORITHM:
**********************************************************************************/
/**********************************************************************************
OUTPUT:
3 3 3
0 0 1
1 1 6
1 2 7
**********************************************************************************/