Array in C

// Find sum of array

#include

void main()
{
int num[10],i,sum=0;

printf(“Enter the 10 number:\n”);
for(i=0;i<10;i++)
{
scanf(“%d”,&num[i]);
sum+=num[i];
}
printf(“sum=%d”,sum);

}

Output:
Enter the 10 number:
10
20
30
40
50
60
70
90
80
100
sum=550

/*Print odd and even numbers of an array separately*/

#include
#define MAX 50
void main()
{
int arr[MAX],n,i;
printf(“Enter size of Array: “);
scanf(“%d”,&n);
printf(“Enter %d positive elements\n”,n);
for(i=0;i<n;i++)
{
scanf(“%d”,&arr[i]);
}
printf(“\n\nEven numbers: “);

for(i=0;i<n;i++)
{
if(arr[i]%2==0)
{
printf(“%d “,arr[i]);
}
}
printf(“\nOdd numbers: “);
for(i=0;i<n;i++)
{
if(arr[i]%2!=0)
{
printf(“%d “,arr[i]);
}
}
}

Output:
Enter size of Array: 5
Enter 5 positive elements
14 93 2 71 50

Even numbers: 14 2 50
Odd numbers: 93 71

// Find Maximum number from array

#include

void main()
{
int num[10],i,max=0,n;

printf(“How many elements?\n”);
scanf(“%d”,&n);
printf(“Enter %d elements\n”,n);
for(i=0;imax)
{
max=num[i];
}
}
printf(“maximum=%d”,max);

}

Output:
How many elements?
5
Enter 5 elements
25
3
62
54
100
maximum=100

/* Reverse an array*/

#include
#define MAX 50
void main()
{
int arr[MAX],n,i,temp;
printf(“Enter size of Array: “);
scanf(“%d”,&n);
printf(“Enter %d elements\n”,n);
for(i=0;i<n;i++)
{
scanf(“%d”,&arr[i]);
}
for(i=0;i<n/2;i++)
{
temp=arr[i];
arr[i]=arr[n-i-1];
arr[n-i-1]=temp;
}
printf(“\nArray after reversing : \n”);
for(i=0;i<n;i++)
{
printf(“%d “,arr[i]);;
}
}

Output:
Enter size of Array: 5
Enter %d elements
1 2 3 4 5

Array after reversing :
5 4 3 2 1

C Programs. Get More Example from
https://play.google.com/store/apps/details?id=com.kapidhvaj.cprograms

/*Find how many times a number present in array*/

#include
#define MAX 100
void main()
{
int arr[MAX],n,i,item,count=0,a[MAX];
printf(“Enter size of Array: “);
scanf(“%d”,&n);
printf(“Enter %d elements\n”,n);
for(i=0;i<n;i++)
{
scanf(“%d”,&arr[i]);
}
printf(“\nEnter element you want to search: “);
scanf(“%d”,&item);
for(i=0;i<n;i++)
{
if(arr[i]==item)
{
a[count]=i+1;
count++;
}

}
if(count!=0)
{ printf(“\nItem found at “);
for(i=0;i<count;i++)
{
printf(“%d “,a[i]);
}

}
else
{
printf(“\nItem not found”);
}

}

Output:
Enter size of Array: 5
Enter 5 elements
23 6 75 23 0

Enter element you want to search: 23
Item found at 1 4

// find sum two array

#include

void main()
{
int a[10],b[10],c[10],i,n;

printf(“Enter size of array:”);
scanf(“%d”,&n);
printf(“Enter %d elements of array A\n”,n);
for(i=0;i<n;i++)
{
scanf(“%d”,&a[i]);
}
printf(“Enter %d elements of array B\n”,n);
for(i=0;i<n;i++)
{
scanf(“%d”,&b[i]);
}
for(i=0;i<n;i++)
{
c[i]=a[i]+b[i];
}
printf(“third array \n”);
for(i=0;i<n;i++)
{
printf(“%d\n”,c[i]);
}

}

Output:
Enter size of array:5
Enter 5 elements of array A
5
2
3
4
6
Enter 5 elements of array B
5
2
3
4
6
third array
10
4
6
8
12

/*Swapping of two arrays*/

#include
void main(){
int a[5],b[5],c[5],i;
printf(“Enter First array->”);
for(i=0;i”);
for(i=0;i”);
for(i=0;i”);
for(i=0;i<5;i++){
printf(“%d”,b[i]);
}
for(i=0;i”);
for(i=0;i”);
for(i=0;i
1 2 3 4 5
Enter Second array->
6 7 8 9 10

Arrays before swapping
First array-> 1 2 3 4 5
Second array-> 6 7 8 9 10

Arrays after swapping
First array-> 6 7 8 9 10
Second array-> 1 2 3 4 5

// Count Number of Negative,Positive and Zero Array Elements

#include

void main()
{
int m[10],i,pos=0,neg=0,zero=0,n;

printf(“How many numbers ?”);
scanf(“%d”,&n);
printf(“\nEnter %d integer elements \n”,n);
for(i=0;i0)
{
pos++;
}
else if(m[i]<0)
{
neg++;
}
else
{
zero++;
}
}
printf(“\npositive elements=%d\n”,pos);
printf(“\nnegative elements=%d\n”,neg);
printf(“\nzero elements=%d\n”,zero);

}

Output:
How many numbers ?5
Enter 5 integer elements
1
2
0
-3
0
positive elements=2
negative elements=1
zero elements=2

// Insert an Element in Array

#include

void main()
{
int m[10],ins,i,n,pos;

printf(“How many elements ?”);
scanf(“%d”,&n);
printf(“\nEnter %d elements: \n”,n);
for(i=0;ipos;i–)
{
m[i]=m[i-1];
}
m[pos]=ins;
n++;
printf(“\nArray after insertion\n”);
for(i=0;i<n;i++)
{
printf(“\n%d\n”,m[i]);
}

}

Output:
How many elements:5
Enter 5 elementes:
1
2
5
6
4
Enter number to be inserted:3
Enter position:2
Array after insertion
1
2
3
5
6
4

// Delete an Element from Array

#include

void main()
{
int m[10],del,i,j,n;

printf(“How many elements ?”);
scanf(“%d”,&n);
printf(“\nEnter %d elements\n”,n);
for(i=0;i<n;i++)
{
scanf(“%d”,&m[i]);
}
printf(“\nEnter number for delete:”);
scanf(“%d”,&del);
for(i=0;i<n;i++)
{
if(m[i]==del)break;
}
for(j=i;j<n;j++)
{
m[j]=m[j+1];
}
n–;
printf(“\nAfter deletion\n”);
for(i=0;i<n;i++)
{
printf(“%d\n”,m[i]);
}

}

Output:
How many elements?5
Enter 5 elements
1
20
10
30
60
Enter element for delete
20
After deletion
1
10
30
60

// Acending and Descending Order in array

#include

void main()
{
int arr[10],tmp[10],i,j,temp;
clrscr();
for(i=0;i<10;i++)
{
printf(“\nEnter value of %d Elements:”,i+1);
scanf(“%d”,&arr[i]);
tmp[i]=arr[i];
}
for(i=0;i<10;i++)
{
for(j=i+1;jarr[j])
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}

printf(“\n——————————————-“);
printf(“\n Original\tAccending\tDescending”);
printf(“\n——————————————-“);
for(i=0,j=9;i<10;i++,j–)
{
printf(“\n%d\t\t%d\t\t%d”,tmp[i],arr[i],arr[j]);
}
printf(“\n——————————————-“);
printf(“\n\n\n press any key—–“);

}

Output:
Enter value of 1 Elements:10
Enter value of 2 Elements:20
Enter value of 3 Elements:23
Enter value of 4 Elements:52
Enter value of 5 Elements:1
Enter value of 6 Elements:30
Enter value of 7 Elements:40
Enter value of 8 Elements:55
Enter value of 9 Elements:3
Enter value of 10 Elements:2
——————————————-
Original Accending Descending
——————————————-
10 1 55
20 2 52
23 3 40
52 10 30
1 20 23
30 23 20
40 30 10
55 40 3
3 52 2
2 55 1

// Bubble short

#include

int main() {

int array[50], n, i, j, swap;

printf(“Enter number of elements\n”);
scanf(“%d”, &n);

printf(“Enter %d integers\n”, n);

for (i = 0; i < n; i++)
scanf(“%d”, &array[i]);

for (i = 0; i < (n – 1); i++) {

for (j = 0; j array[j + 1]) /* For decreasing order use < */
{
swap = array[j];
array[j] = array[j + 1];
array[j + 1] = swap;
}
}
}

printf(“Sorted list in ascending order:\n”);

for (i = 0; i < n; i++)
{
printf(“%d\n”, array[i]);
}

return 0;

}

Output:

Enter number of elements 5
Enter 5 integers
20
90
0
-23
78
Sorted list in ascending order:
-23
0
20
78
90

// Insertion sort

#include

int main() {

int n, array[50], c, d, t;

printf(“Enter number of elements\n”);
scanf(“%d”, &n);

printf(“Enter %d integers\n”, n);

for (c = 0; c < n; c++) {

scanf(“%d”, &array[c]);

}

for (c = 1; c 0 && array[d] < array[d – 1]) {

t = array[d];
array[d] = array[d – 1];
array[d – 1] = t;

d–;

}
}

printf(“Sorted list in ascending order:\n”);

for (c = 0; c <= n – 1; c++) {

printf(“%d\n”, array[c]);

}

return 0;
}

Output:

Enter number of elements 5
Enter 5 integers
20
90
0
-23
78
Sorted list in ascending order:
-23
0
20
78
90

// Selection Sort

#include

int main() {

int array[100], n, c, d, position, swap;

printf(“Enter number of elements\n”);
scanf(“%d”, &n);

printf(“Enter %d integers\n”, n);

for (c = 0; c < n; c++)
scanf(“%d”, &array[c]);

for (c = 0; c < (n – 1); c++) {
position = c;

for (d = c + 1; d array[d])
position = d;

}

if (position != c) {

swap = array[c];
array[c] = array[position];
array[position] = swap;

}
}

printf(“Sorted list in ascending order:\n”);

for (c = 0; c < n; c++)
printf(“%d\n”, array[c]);

return 0;
}

Output:

Enter number of elements 5
Enter 5 integers
20
90
0
-23
78
Sorted list in ascending order:
-23
0
20
78
90

// Linear Search

#include

int main()
{
int array[50], search, c, n;

printf(“Enter the number of elements in array\n”);
scanf(“%d”,&n);

printf(“Enter %d integer(s)\n”, n);

for (c = 0; c < n; c++)
scanf(“%d”, &array[c]);

printf(“Enter the number to search\n”);
scanf(“%d”, &search);

for (c = 0; c < n; c++)
{
if (array[c] == search) /* if required element found */
{
printf(“%d is present at location %d.\n”, search, c+1);
break;
}
}
if (c == n)
printf(“%d is not present in array.\n”, search);

return 0;
}

Output:

Enter the number of elements in array 5
Enter 5 integer(s)
10 23 78 34 21

Enter the number to search 78
78 is present at location 3.

// Binary Search example

#include

int main()
{
int num[10], i, beg, end, mid, pos = -1, value;

printf( ” Enter Ten Numbers in Ascending Order::: \n” );
for( i=0 ; i<10 ; i++ )
{
scanf( “%d”, &num[i] );
}

printf( ” Enter the number to be searched ::: ” );
scanf( “%d”, &value );

beg = 0;
end = 10 – 1;
while(beg = num[mid] )
beg = mid + 1;
else
end = mid – 1;
}

if( pos == -1 )
{
printf( “\n The element %d not found.”, value );
}
else
{
printf( “\n The position of %d is ::: %d” , value, pos );
}

return 0;
}

Output:

Enter Ten Numbers in Ascending Order:::
1 5 13 24 25 36 47 58 69 100
Enter the number to be searched ::: 36

The position of 36 is ::: 6

// Simple matrix in array

#include

int main()
{
int a[3][3];
int i, j;

printf( “Enter value : ” );

for( i=0 ; i<3 ; i++ )
{
for( j=0 ; j<3 ; j++ )
{
scanf( “%d”, &a[ i ][ j ] );
}
}

printf( “\n The Matrix is ::: \n” );
for( i=0 ; i<3 ; i++ )
{
for( j=0 ; j<3 ; j++ )
{
printf( “%d “, a[ i ][ j ] );
}
printf( “\n” );
}

return 0;
}

Output:

Enter value : 1 2 3 4 5 6 7 8 9
The Matrix is :::
1 2 3
4 5 6
7 8 9

// Transpose of matrix

#include

void main()
{
int n,a[10][10],j,i;

printf(“Enter N:”);
scanf(“%d”,&n);
printf(“Enter %d*%d matrix\n”,n,n);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
scanf(“%d\t”,&a[i][j]);
}
}
printf(“Original matrix\n”);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf(“%d\t”,a[i][j]);
}
printf(“\n”);
}
printf(“Traspose matrix\n”);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf(“%d\t”,a[j][i]);
}
printf(“\n”);
}

}

Output:
Enter N:3
Enter 3*3 matrix
1
2
3
4
5
6
7
8
9
Original matrix
1 2 3
4 5 6
7 8 9
Transpose matrix
1 4 7
2 5 8
3 6 9

//Sort all Elements of 2D array row wise haveing 3 row and 3 columns

#include

void main()
{
int a[3][3],i,j,k,temp;

printf(“Enter 3*3 matrix A \n”);
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
scanf(“%d”,&a[i][j]);
}
}
for(i=0;i<3;i++)
{
for(j=0;j<3-1;j++)
{
for(k=j+1;ka[i][k])
{
temp=a[i][j];
a[i][j]=a[i][k];
a[i][k]=temp;
}
}
}
}
printf(“\nRow by row sorted\n”);
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
printf(“%d\t”,a[i][j]);
}
printf(“\n”);
}

}

Output:
Enter 3*3 matrix A:
4
5
2
6
2
9
5
8
3
Row by row sorted
2 4 5
2 6 9
3 5 8

// Sum of diagonal elements of a matrix in c

#include
void main(){
int a[10][10],i,j,sum=0,m,n;
printf(“\nEnter the row and column of matrix: “);
scanf(“%d%d”,&m,&n);
printf(“\nEnter the elements of matrix: “);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf(“%d”,&a[i][j]);
}
}
printf(“\nThe matrix is\n”);
for(i=0;i<m;i++)
{
printf(“\n”);
for(j=0;j<m;j++)
{
printf(“%d\t”,a[i][j]);
}
}

for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(i==j)
sum=sum+a[i][j];
}
}

printf(“\nSum of the diagonal elements of a matrix is: %d”,sum);
}

Output:

Enter the row and column of matrix: 3 3
1 2 3 4 5 6 7 8 9

The matrix is

1 2 3
4 5 6
7 8 9

Sum of the diagonal elements of a matrix is: 15