Professional Documents
Culture Documents
Week 3
Week 3
Week 3
PROGRAM:-
#include<stdio.h>
int main()
int a[100],i,n,min,max;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
min=a[0];
max=a[0];
for(i=1;i<n;i++)
if(a[i]<min)
min=a[i];
if(a[i]>max)
max=a[i];
printf("smallest number=%d\n",min);
printf("largest number=%d\n",max);
1
return 0;
OUTPUT:-
12
38
smallest number=5
largest number=38
PROGRAM:-
#include<stdio.h>
int main()
int a[10][10],i,j,r,c;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++)
2
{
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
if(j>i)
printf("0\t");
else
printf("%d\t",a[i][j]);
printf("\n");
return 0;
OUTPUT:-
3
1
1 0 0
4 5 0
7 8 9
PROGRAM:-
#include<stdio.h>
int main()
int i,j,size;
int sparce_matrix[4][5]={{0,0,4,0,9},{0,0,5,7,0},{0,0,0,0,0},{0,2,3,0,0}};
for(i=0;i<4;i++)
for(j=0;j<5;j++)
4
{
if(sparce_matrix[i][j]!=0)
size++;
int matrix[3][size];
int k=0;
for(i=0;i<4;i++)
for(j=0;j<5;j++)
if(sparce_matrix[i][j]!=0)
matrix[0][k]=i;
matrix[1][k]=j;
matrix[2][k]=sparce_matrix[i][j];
k++;
for(i=0;i<3;i++)
for(j=0;j<size;j++)
5
printf("%d",matrix[i][j]);
printf("\t");
printf("\n");
return 0;
OUTPUT:-
0 0 1 1 3
3 4 2 3 1
2 9 5 7 2