Program. SUBJECT: ACP (C - Programming) Array Program. // Find the minimum number from given N element. Prepared By : Dhaval R.

Size: px

Start display at page:

Download "Program. SUBJECT: ACP (C - Programming) Array Program. // Find the minimum number from given N element. Prepared By : Dhaval R."

Amos Morris
6 years ago
Views:

1 Program // Find the minimum number from given N element. #include<stdio.h> #include<conio.h> void main() int a[50],i,n,min; clrscr(); printf("\n Enter array size : "); scanf("%d",&n); printf("\n Enter No. : "); scanf("%d",&a[i]); min=a[0]; if(a[i]<min) 1

$min=a[i]; printf("\n Minimum Number = %d",min); getch(); // Find the maximum number$

2 min=a[i]; printf("\n Minimum Number = %d",min); getch(); // Find the maximum number from given N element. #include<stdio.h> #include<conio.h> void main() int a[50],i,n,max; 2

3 clrscr(); printf("\n Enter array size : "); scanf("%d",&n); printf("\n Enter No. : "); scanf("%d",&a[i]); max=a[0]; if(a[i]>max) max=a[i]; printf("\n Maximum Number = %d",max); getch(); 3

$h> void main() int a[50],i,n,x,p; clrscr(); printf("\n Enter array size : "); scanf("%d",&n); printf("enter$

4 // Insert the element in array at given position. #include<stdio.h> #include<conio.h> void main() int a[50],i,n,x,p; clrscr(); printf("\n Enter array size : "); scanf("%d",&n); printf("enter a[%d] : ",i); scanf("%d",&a[i]); 4

5 printf("\n Enter new element : "); scanf("%d",&x); printf("\n Enter new element position : "); scanf("%d",&p); if(p>0 && p<=n) i=n; while(p!=(i+1)) a[i]=a[i-1]; i=i-1; a[i]=x; printf("\n"); for(i=0;i<n+1;i=i+1) printf("\n a[%d] = %d",i,a[i]); else 5

$printf("\n Position Not Found"); getch(); // Delete the element from array at given$

6 printf("\n Position Not Found"); getch(); // Delete the element from array at given position. #include<stdio.h> #include<conio.h> void main() int a[50],i,n,p; clrscr(); 6

7 printf("\n Enter array size : "); scanf("%d",&n); printf("enter a[%d] : ",i); scanf("%d",&a[i]); printf("\n Enter position for delete: "); scanf("%d",&p); if(p>0 && p<=n) for(i=p;i<(n-1);i=i+1) a[i]=a[i+1]; printf("\n"); for(i=0;i<n-1;i=i+1) printf("\n a[%d] = %d",i,a[i]); 7

$else printf("\n Position Not Found"); getch(); // Search the element from$

8 else printf("\n Position Not Found"); getch(); // Search the element from array of given position. #include<stdio.h> #include<conio.h> void main() 8

9 int a[50],i,n,x,p; clrscr(); printf("\n Enter array size : "); scanf("%d",&n); printf("enter a[%d] : ",i); scanf("%d",&a[i]); printf("\n Enter position for delete: "); scanf("%d",&p); if(p>0 && p<=n) if((i+1)==p) x=a[i]; printf("\n Element = %d",x); 9

$else printf("\n Position Not Found"); getch(); // Enter the n element and arrange them on accending order (SORT)$

10 else printf("\n Position Not Found"); getch(); // Enter the n element and arrange them on accending order (SORT) #include<stdio.h> #include<conio.h> void main() int a[50],i,n,temp,j; clrscr(); printf("\n Enter array size : "); 10

11 scanf("%d",&n); printf("enter a[%d] : ",i); scanf("%d",&a[i]); for(j=i;j<n;j=j+1) if(a[j]<a[i]) temp=a[i]; a[i]=a[j]; a[j]=temp; printf("\n"); 11

$printf("\n %d",a[i]); getch(); // Enter two array and marge them #include<stdio.h> #include<conio.$

12 printf("\n %d",a[i]); getch(); // Enter two array and marge them #include<stdio.h> #include<conio.h> void main() int a[50],b[50],c[100],n,i,j=0; clrscr(); printf("\n Enter array size : "); scanf("%d",&n); printf("\n Enter Array1\n"); 12

13 printf("enter a[%d] : ",i); scanf("%d",&a[i]); printf("\n Enter Array2\n"); printf("enter b[%d] : ",i); scanf("%d",&b[i]); for(i=0;i<(n+n);i=i+1) if(i<n) c[i]=a[i]; else c[i]=b[j]; 13

$j=j+1; printf("\n Marg Array");$

14 j=j+1; printf("\n Marg Array"); for(i=0;i<(n+n);i=i+1) printf("\n %d",c[i]); getch(); 14

15 // Enter the one 2d array with size[n x m] matrix and display them. #include<stdio.h> #include<conio.h> void main() int a[10][10],i,j,n,m; clrscr(); printf("\n Enter raw size : "); scanf("%d",&n); printf("\n Enter coloum size : "); scanf("%d",&m); for(j=0;j<m;j=j+1) printf("enter a[%d][%d] : ",i,j); scanf("%d",&a[i][j]); 15

$printf("\n\n"); for(j=0;j<m;j=j+1)$

16 printf("\n\n"); for(j=0;j<m;j=j+1) printf(" %d",a[i][j]); printf("\n"); getch(); 16

17 // Enter the two 2d array with size[n x m] and find total them. // And store them in third array #include<stdio.h> #include<conio.h> void main() int a[10][10],b[10][10],c[10][10],i,j,n,m; clrscr(); printf("\n Enter raw size : "); scanf("%d",&n); printf("\n Enter coloum size : "); scanf("%d",&m); printf("\n array1 \n"); for(j=0;j<m;j=j+1) printf("enter a[%d][%d] : ",i,j); scanf("%d",&a[i][j]); 17

18 printf("\n array2 \n"); for(j=0;j<m;j=j+1) printf("enter b[%d][%d] : ",i,j); scanf("%d",&b[i][j]); printf("\ntotal\n"); for(j=0;j<m;j=j+1) c[i][j]=a[i][j]+b[i][j]; printf(" %d",c[i][j]); printf("\n"); getch(); 18

19 // Enter the two 2d array with size[m x m] and find multiplication them. // And store them in third array #include<stdio.h> #include<conio.h> void main() int a[10][10],b[10][10],c[10][10],i,j,k,n,t; 19

20 clrscr(); printf("\n Enter size : "); scanf("%d",&n); printf("\n array1 \n"); for(j=0;j<n;j=j+1) printf("enter a[%d][%d] : ",i,j); scanf("%d",&a[i][j]); printf("\n array2 \n"); for(j=0;j<n;j=j+1) printf("enter b[%d][%d] : ",i,j); scanf("%d",&b[i][j]); 20

21 printf("\nmultiplication\n"); for(j=0;j<n;j=j+1) t=0; for(k=0;k<n;k=k+1) t=t+(a[i][k]*b[k][j]); c[i][j]=t; printf(" %d",c[i][j]); printf("\n"); getch(); 21

$h> void main() int a[10][10],i,j,n; clrscr(); printf("\n Enter size : "); scanf("%d",&n); printf("\n array$

22 // Enter the 2d array with size[m x m] and display upper triangle #include<stdio.h> #include<conio.h> void main() int a[10][10],i,j,n; clrscr(); printf("\n Enter size : "); scanf("%d",&n); printf("\n array \n"); 22

23 for(j=0;j<n;j=j+1) printf("enter a[%d][%d] : ",i,j); scanf("%d",&a[i][j]); printf("\n\n"); for(j=0;j<n;j=j+1) printf(" %d",a[i][j]); printf("\n"); printf("\n Upper Trianle\n"); for(j=0;j<n;j=j+1) 23

24 if(i<j) printf(" %d",a[i][j]); else printf(" "); printf("\n"); getch(); 24

$h> void main() int a[10][10],i,j,n; clrscr(); printf("\n Enter size : "); scanf("%d",&n); printf("\n array$

25 // Enter the 2d array with size[m x m] and display lower triangle #include<stdio.h> #include<conio.h> void main() int a[10][10],i,j,n; clrscr(); printf("\n Enter size : "); scanf("%d",&n); printf("\n array \n"); 25

26 for(j=0;j<n;j=j+1) printf("enter a[%d][%d] : ",i,j); scanf("%d",&a[i][j]); printf("\n\n"); for(j=0;j<n;j=j+1) printf(" %d",a[i][j]); printf("\n"); printf("\n Lower Trianle\n"); for(j=0;j<n;j=j+1) 26

27 if(i>j) printf(" %d",a[i][j]); else printf(" "); printf("\n"); getch(); 27

28 // Enter the 2d array with size[m x m] and chack it is daigonist or not #include<stdio.h> #include<conio.h> void main() int a[10][10],i,j,n,f; clrscr(); printf("\n Enter size : "); scanf("%d",&n); 28

29 printf("\n array \n"); for(j=0;j<n;j=j+1) printf("enter a[%d][%d] : ",i,j); scanf("%d",&a[i][j]); printf("\n\n"); for(j=0;j<n;j=j+1) printf(" %d",a[i][j]); printf("\n"); printf("\n\n"); 29

30 for(j=0;j<n;j=j+1) if(i==j) if(a[i][j]==1) f=0; else f=1; goto r; else printf(" "); if(a[i][j]==0) f=0; 30

31 else f=1; goto r; r: if(f==0) printf("\n Diagonist Matrix"); else printf("\n Not Diagonist Matrix"); getch(); 31

32 32

Saini Technologies ADVANCED C PROGRAMMING WITH SAINI TECHNOLOGIES. Sushil Kumar Saini Mo.

Saini Technologies ADVANCED C PROGRAMMING WITH SAINI TECHNOLOGIES Sushil Kumar Saini Email: Sushilsaini04@gmail.com Mo. 9896470047 Integer Array int a[]=12,34,54,45,34,34; printf("%d",a[0]); printf(" %d",a[1]);