RECURSION

/* Calculate factorial by using recursion */

#include
#include
int fact(int k)
{
if(k==0)
return 1;
else
return k*fact(k-1);
}
void main()
{
int n;
clrscr();
printf("\n Enter a number :");
scanf("%d",&n);
printf("\n Factorial value=%d",fact(n));
getch();
}
MATRIX MULTIPLICATION
void main()
{
int a[10][10], b[10][10],i,j,k n,m,s;
cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
cin>>m;
for(i=1;i<=m;i++)
{
for(j=1;j<m;j++)
{
cin>>b[i][j];
}
}
if(m!=n)
exit();
else
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
c[i][j]=0;
for(k=1;k<=n;k++)
c[i][j]=a[i][k]*b[k][j]+c[i][j];
}
}
}
now output c[i][j];