Transpose a Matrix

Click Here To Download C File Of This Program

 //TRANSPOSE A MATRIX  
 //Downloaded from www.c4cprog.co.nr  
 #include<conio.h>  
 void trans(int a[][100],int r,int c)  
 {  
 int i,j,t;  
 if(r==c)  
 {  
 printf("\n\nEnter Array :\n");  
 for(i=0;i<r;i++)  
 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)  
 {  
 t=a[i][j];  
 a[i][j]=a[j][i];  
 a[j][i]=t;  
 }  
 }  
 printf("\n\nArray After Transposing :");  
 for(i=0;i<r;i++)  
 {  
 printf("\n");  
 for(j=0;j<c;j++)  
 printf("\t%d",a[i][j]);  
 }  
 }  
 else  
 printf("\n\nUnsymmetrical Array - Transpose IMPOSSIBLE !!!");  
 }  
 void main()  
 {  
 int a[100][100],r,c,i,j     ;  
 clrscr();  
 printf("\nEnter Array Row Limit :");  
 scanf("%d",&r);  
 printf("\nEnter Array Column Limit :");  
 scanf("%d",&c);  
 trans(a,r,c);  
 getch();  
 }  

Sort & Search using Pointers

Click Here To Download C File Of This Program

 //PROGRAM TO SORT GIVEN ARRAY OF NUMBERS & SEARCH GIVEN NO USING POINTERS  
 //Downloaded from www.c4cprog.co.nr  
 #include<conio.h>  
 void sort(int *g,int n)  
 {  
 int i,j,b;  
 printf("\nSorted Array :");  
 for(i=0;i<n;i++)  
 for(j=0;j<n-1;j++)  
      if(*(g+j)>*((g+j)+1))  
      {  
      b=*(g+j);  
      *(g+j)=*((g+j)+1);  
      *((g+j)+1)=b;  
      }  
 for(i=0;i<n;i++)  
 printf("\n%d",*(g+i));  
 }  
 void search(int *g,int n)  
 {  
 int u,mid,l,k=0,x;  
 printf("\n\nEnter Element To Be Searched For :");  
 scanf("%d",&x);  
 u=n-1;  
 l=0;  
 while(l<=u)  
      {  
      mid=((u+l)/2);  
      if(*(g+mid)>x)  
      u=mid-1;  
      if(*(g+mid)<x)  
      l=mid+1;  
      if(*(g+mid)==x)  
      {  
      printf("\n\nElement Is Found At Position %d",mid+1);  
      k++;  
      break;}  
      }  
 if(k==0)  
 printf("\nElemnt NOT FOUND !!!");  
 }  
 void main()  
 {  
 int x,a[100],*g,i,n,k,op;  
 char v;  
 clrscr();  
 do{  
 printf("\n\nEnter Limit :");  
 scanf("%d",&n);  
 printf("\nEnter Array :\n");  
 for(i=0;i<n;i++)  
 scanf("%d",&a[i]);  
 g=&a[0];  
 sort(g,n);  
 search(g,n);  
 printf("\n\nPress 'e' To EXIT & Any Other Key To CONTINUE :");  
 scanf(" %c",&v);  
 }while(v!='e');  
 }  
 /*  
 OUTPUT  
 Enter Limit :5  
 Enter Array :  
 4  
 1  
 5  
 7  
 4  
 Sorted Array :  
 1  
 4  
 4  
 5  
 7  
 Enter Element To Be Searched For :4  
 Element Is Found At Position 4  
 Press 'e' To EXIT & Any Other Key To CONTINUE :e  
 */  

Min & Max of a set of nos. using Functions

Click Here To Download C File Of This Program

 //Read n nos & read the min & max using 2 functions  
 //Downloaded from www.c4cprog.co.nr  
 #include<conio.h>  
 int maximum(int p)  
 {  
 int max;  
 max=p;  
 return(max);  
 }  
 int minimum(int p)  
 {  
 int min;  
 min=p;  
 return(min);  
 }  
 void main()  
 {  
 int n,min,max,p=0,i,k=0;  
 clrscr();  
 printf("Enter The Limit :");  
 scanf("%d",&n);  
 max=0;  
 min=31000;  
 printf("Enter The Nos :");  
 for(i=0;i<n;i++)  
 {  
 scanf("%d",&p);  
 if((p<0)&&(i==1))  
 {max=p;}  
 if(p>max)  
 max = maximum(p);  
 if(p<min)  
 min = minimum(p);  
 }  
 printf("\nMaximum Of Nos = %d\nMinimum Of Nos = %d",max,min);  
 getch();  
 }  

Linear Search

Click Here To Download C File Of This Program

 //PROGRAM TO PERFORM LINEAR SEARCH  
 //Downloaded from www.c4cprog.co.nr  
 #include<conio.h>  
 void calc(int a[],int x,int n)  
 {  
 int k=0,i;  F
 for(i=0;i<n;i++)  
 if(a[i]==x)  
 {  
 printf("\n\nElement is found at Position : %d ",i+1);  
 k++;  
 }  
 if(k==0)  
 printf("\nElemnt NOT FOUND !!!");  
 }  
 void main()  
 {  
 int x,a[100],i,n,k;  
 clrscr();  
 printf("Enter Limit :");  
 scanf("%d",&n);  
 printf("\n\nEnter Array :\n");  
 for(i=0;i<n;i++)  
 scanf("%d",&a[i]);  
 printf("\nEnter Element To Be Searched For :");  
 scanf("%d",&x);  
 calc(a,x,n);  
 getch();  
 }  

Largest & Smallest in an Array

Click Here To Download C File Of This Program

 //PRINT LARGEST AND SMALLEST OF AN ARRAY  
 //Downloaded from www.c4cprog.co.nr  
 #include<conio.h>  
 int maximum(int a[],int i)  
 {  
 int max;  
 max=a[i];  
 return(max);  
 }  
 int minimum(int a[],int i)  
 {  
 int min;  
 min=a[i];  
 return(min);  
 }  
 void main()  
 {  
 int n,min,max,a[100],i;  
 clrscr();  
 printf("Enter The Limit :");  
 scanf("%d",&n);  
 printf("\nEnter The Nos :");  
 for(i=0;i<n;i++)  
 scanf("%d",&a[i]);  
 max=0;  
 min=31000;  
 for(i=0;i<n;i++)  
 {  
 if((a[i]<0)&&(i==1))  
 {max=a[i];}  
 if(a[i]>max)  
 max = maximum(a,i);  
 if(a[i]<min)  
 min = minimum(a,i);  
 }  
 printf("\nMaximum Of Nos = %d\nMinimum Of Nos = %d",max,min);  
 getch();  
 }  

Fibonacci using recursive Function

Click Here To Download C File Of This Program

 //Generate Fibonacci Series  
 //Downloaded from www.c4cprog.co.nr  
 #include<conio.h>  
 int a=0,b=1,s=0,c=0;  
 void fibo(int l)  
 {  
 printf("%d ",a);  
 c=a+b;  
 a=b;  
 b=c;  
 s++;  
 if(s!=l)  
 fibo(l);  
 }  
 void main()  
 {  
 int l;  
 clrscr();  
 printf("Enter Limit  : ");  
 scanf("%d",&l);  
 printf("\n\nFibonacci Series :\n\n");  
 fibo(l);  
 getch();  
 }  

Factorial using recursive Function

Click Here To Download C File Of This Program

 //Find Factorial  
 //Downloaded from www.c4cprog.co.nr  
 #include<conio.h>  
 long int s=1;  
 void fact(int a)  
 {  
 s=s*a;  
 a--;  
 if(a>0)  
 fact(a);  
 else  
 printf("The Factorial of the given No. is : %ld",s);  
 }  
 void main()  
 {  
  int a;  
 clrscr();  
 printf("\nEnter The No  : ");  
 scanf("%d",&a);  
 fact(a);  
 getch();  
 }  

Binary Search

Click Here To Download C File Of This Program

 //PROGRAM TO PERFORM BINARY SEARCH 
//Downloaded from www.c4cprog.co.nr 
#include<conio.h> 
void sort(int a[],int n) 
{ 
int i,j,b; 
printf("\nSorted Array :"); 
for(i=0;i<n;i++) 
for(j=0;j<n-1;j++) 
if(a[j]>a[j+1]) 
{ 
b=a[j]; 
a[j]=a[j+1]; 
a[j+1]=b; 
} 
for(i=0;i<n;i++) 
printf("\n%d",a[i]); 
} 
void search(int a[],int n) 
{ 
int u,mid,l,k=0,x; 
printf("\nEnter Element To Be Searched For :"); 
scanf("%d",&x); 
u=n-1; 
l=0; 
while(l<=u) 
{ 
mid=((u+l)/2); 
if(a[mid]>x) 
u=mid-1; 
if(a[mid]<x) 
l=mid+1; 
if(a[mid]==x) 
{ 
printf("\n\nElement Is Found At Position %d",mid+1); 
k++; 
break;} 
} 
if(k==0) 
printf("\nElemnt NOT FOUND !!!"); 
} 
void main() 
{ 
int n,a[100],i; 
clrscr(); 
printf("Enter Limit :"); 
scanf("%d",&n); 
printf("\n\nEnter Array :\n"); 
for(i=0;i<n;i++) 
scanf("%d",&a[i]); 
sort(a,n); 
search(a,n); 
getch(); 
} 

Array Operations - Reverse, Insert, Delete, Merge

Click Here To Download C File Of This Program

 //Program To Perform Array Operations 
//Downloaded from www.c4cprog.co.nr 
#include<conio.h> 
void array_reverse(int a[],int n) 
{int j,i,r[100]; 
j=n; 
for(i=0;i<n;i++,j--) 
r[i]=a[j-1]; 
printf("\n\nArray After Reversing :"); 
for(i=0;i<n;i++) 
printf("\n%d",r[i]); 
} 
void array_merge(int a[],int n) 
{ 
int i,q,j,r[100],b[100],p; 
printf("\n\nEnter Second Array Limit :"); 
scanf("%d",&q); 
printf("\n\nEnter Array B :\n"); 
for(i=0;i<q;i++) 
scanf("%d",&b[i]); 
for(j=0;j<n;j++) 
r[j]=a[j]; 
for(i=0;i<q;i++) 
{ 
r[j]=b[i]; 
j++; 
} 
printf("\n\nThe Array After Merging :"); 
for(i=0;i<n+q;i++) 
printf("\n%d",r[i]); 
} 
void array_insert(int a[],int n) 
{ 
int q,po,i,j; 
printf("\n\nEnter the Element To Be Inserted to Array A :"); 
scanf("%d",&q); 
printf("\n\nEnter the Position To Be Inserted to Array A :"); 
scanf("%d",&po); 
for(i=0;i<n;i++) 
if(i==po) 
for(j=n;j>=po;j--) 
a[j]=a[j-1]; 
a[po-1]=q; 
printf("\n\nThe Array After Inserting :"); 
for(i=0;i<=n;i++) 
printf("\n%d",a[i]); 
} 
void array_delete(int a[],int n) 
{ 
int q,j,i,k=0,c; 
printf("\n\nEnter the Element To Be Deleted From Array A :"); 
scanf("%d",&q); 
c=n; 
for(i=0;i<n;i++) 
{ 
if(a[i]==q) 
{ 
c--; 
k++; 
for(j=i;j<n-1;j++) 
a[j]=a[j+1]; 
i--; 
}} 
if(k==0) 
printf("\n\nThe Element not Found !!!"); 
if(k>0) 
{ 
printf("\n\nThe Array After Deleting :"); 
for(i=0;i<c;i++) 
printf("\n%d",a[i]); 
} 
getch(); 
} 
void main() 
{ 
int op,n,i,a[100]; 
char v; 
do{ 
clrscr(); 
printf("Enter Limit :"); 
scanf("%d",&n); 
printf("\n\nEnter Array A :\n"); 
for(i=0;i<n;i++) 
scanf("%d",&a[i]); 
printf("\n\nEnter Your Choice :\n1.Reverse\n2.Merge\n3.Insert\n4.Delete\n\nEnter :"); 
scanf("%d",&op); 
switch(op) 
{ 
case 1: 
array_reverse(a,n); 
break; 
case 2: 
array_merge(a,n); 
break; 
case 3: 
array_insert(a,n); 
break; 
case 4: 
array_delete(a,n); 
break; 
default : 
printf("\n\nWrong Choice"); 
break; 
} 
printf("\n\nPress 'e' to EXIT and any other key to continue :"); 
scanf(" %c",&v); 
}while(v!='e'); 
} 

Array - Main & Secondary Diagonal, Upper & Lower Triangle

Click Here To Download C File Of This Program

 //PROGRAM TP PRINT MAIN DIAGONAL, OFF DIAGONAL, THEIR SUM, UPPER & LOWER RIANGLE 
//Downloaded from www.c4cprog.co.nr 
#include<conio.h> 
void diag(int a[][100],int r,int c) 
{ 
int i,j,sum=0,op; 
printf("\n\n1.Main Diagonal\n2.Off Diagonal :"); 
scanf("%d",&op); 
if(op==1) 
{ 
printf("\n\n"); 
printf("\n\nMain Diagonal"); 
for(i=0;i<r;i++) 
{ 
printf("\n"); 
for(j=0;j<c;j++) 
{ 
printf("\t"); 
if(i==j) 
{ 
printf("%d",a[i][j]); 
sum=sum+a[i][j]; 
}}} 
printf("\n\nSum : %d",sum); 
} 
if(op==2) 
{ 
printf("\n\n"); 
printf("\n\nOff Diagonal"); 
sum=0; 
for(i=0;i<r;i++) 
{ 
printf("\n"); 
for(j=0;j<c;j++) 
{ 
printf("\t"); 
if(i+j==(r-1)) 
{ 
printf("%d",a[i][j]); 
sum=sum+a[i][j]; 
}}} 
printf("\n\nSum : %d",sum); 
} 
if(i>2) 
printf("\n\nWrong Choice !!"); 
} 
void tria(int a[][100],int r,int c) 
{ 
int i,j,op; 
printf("\n\n1.Upper Triangle\n2.Lower Triangle :"); 
scanf("%d",&op); 
if(op==2) 
{ 
printf("\n\nLower Triangle :"); 
printf("\n\n"); 
for(i=0;i<r;i++) 
{ 
printf("\n"); 
for(j=0;j<c;j++) 
{ 
printf("\t"); 
if(i>=j) 
printf("%d",a[i][j]); 
}} 
} 
if(op==1) 
{ 
printf("Upper Triangle"); 
printf("\n\n"); 
for(i=0;i<r;i++) 
{ 
printf("\n"); 
for(j=0;j<c;j++) 
{ 
printf("\t"); 
if(i<=j) 
printf("%d",a[i][j]); 
}}} 
if(i>2) 
printf("\n\nWrong Choice !!"); 
} 
void main() 
{ 
int r,c,a[100][100],i,j,op; 
char v; 
clrscr(); 
do{ 
printf("\nEnter Array Row Limit :"); 
scanf("%d",&r); 
printf("\nEnter Array Column Limit :"); 
scanf("%d",&c); 
if(r==c) 
{ 
printf("\nEnter Array :\n"); 
for(i=0;i<r;i++) 
for(j=0;j<c;j++) 
scanf("%d",&a[i][j]); 
printf("\n\nOptions :\n\n1.Diagonal & Sum\n2.Triangle\n\nEnter :"); 
scanf("%d",&op); 
switch(op) 
{ 
case 1: 
diag(a,r,c); 
break; 
case 2: 
tria(a,r,c); 
break; 
default : 
printf("\n\nWrong Choice"); 
} 
} 
else 
printf("\n\nNo. Of Rows Not Equal To No. Of Columns !!!"); 
printf("\n\nPress 'e' To EXIT & Any Other Key To Continue :"); 
scanf(" %c",&v); 
}while(v!='e'); 
} 

Check for Armstrong No.

Click Here To Download C File Of This Program

 //Program to check wether the given no. is armstrong no using functions 
//Downloaded from www.c4cprog.co.nr 
#include<conio.h> 
void armstrong(int n) 
{ 
int i,t,p,s,x; 
for(i=1;i<=n;i++) 
{ 
p=i; 
t=p; 
s=0; 
while(p>0) 
{ 
x=p%10; 
s=s+(x*x*x); 
p=p/10; 
} 
if(s==t) 
printf("\t%d ",t); 
} 
} 
void main() 
{ 
int n; 
clrscr(); 
printf("\n\tEnter The Limit :"); 
scanf("%d",&n); 
printf("\n\tArmstrong Nos Are :"); 
armstrong(n); 
getch(); 
}