Search an Element

// Searching an Element

#include<stdio.h>

#define SIZE 10

void search(int a[],int no)

{

int i, flag = 0;

for(i=0;i<=a[i];i++)

{

if(no == a[i])

{

printf("%d Found at Position %d And Index No is %d",no,i+1,i);

flag=1;

}

if(!flag)

{

printf("%d not Found!!",no);

}

int main()

{

int i,no,elements;

int a[SIZE];

printf("Enter a Number of Elements : ");

scanf("%d",&elements);

for(i=0;i<elements;i++)

{

printf("Enter Element a[%d]: ",i);

scanf("%d",&a[i]);

}

printf("\nEnter a No to search : ");

scanf("%d",&no);

search(a,no);

return 0;

}

Comments

Dynamic Matrix Multiplication

// Matrix Multiplication #include<stdio.h> #define SIZE 5 int main() { int a[SIZE][SIZE],b[SIZE][SIZE],c[SIZE][SIZE],d[SIZE][SIZE]; int i,j,k,r1,r2,c1,c2; printf("Enter the Rows of Matrix - A : "); scanf("%d",&r1); printf("Enter the Columns of Matrix - A : "); scanf("%d",&c1); printf("Enter the Rows of Matrix - B : "); scanf("%d",&r2); printf("Enter the Columns of Matrix - B : "); scanf("%d",&c2); if(c1 == r2) { printf("Enter Elements of Matrix - A\n"); for(i=0;i<r1;i++) { for(j=0;j<c1;j++) { printf("a[%d][%d] : ",i,j); ...

Static Matrix Multiplication

// Matrix Multiplication #include<stdio.h> int main() { int a[3][3],b[3][3],c[3][3],d[3][3]; int i,j,k; printf("Enter Elements of Matrix - A\n"); for(i=0;i<3;i++) { for(j=0;j<3;j++) { printf("a[%d][%d] : ",i,j); scanf("%d",&a[i][j]); } } printf("Enter Elements of Matrix - B \n"); for(i=0;i<3;i++) { for(j=0;j<3;j++) { printf("b[%d][%d] : ",i,j); ...

Simple Matrix

// Simple Matrix Upto n Numbers. (Dynamic) #include<stdio.h> int main() { int i,j,k=1,rc; printf("Enter the No of Columns : "); scanf("%d",&rc); for(i=0;i<rc;i++) { printf("|"); for(j=0;j<rc;j++,k++) { printf("%3d",k); } printf(" | \n"); } return 0; }

BM Programs

Search This Blog