C program to declare,

initialize, input and print array

elements
#include<stdio.h>
#define MAX_SIZE 1000
int main(){
int n,i,a[MAX_SIZE];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
printf("%d\n",a[i]);
}
return 0;

C program to print all

negative elements in array
#include<stdio.h>
#define size 100
int main(){
int i,n,a[size];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
if(a[i]<0){
printf("%d\n",a[i]);
}
}
}
C program to find sum of
array elements
#include<stdio.h>
#define s 1000
int main(){
int i,n,sum=0,a[s];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
sum=sum+a[i];
}
printf("%d",sum);
}

C program to find maximum and

minimum element in array
#include<stdio.h>
#define s 100
int main(){
int i,n,a[s];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int max=a[0];
int min=a[0];
for(i=0;i<n;i++){
if(a[i]>max){
max=a[i];
}
if(a[i]<min){
min=a[i];
}
}
printf("max %d and min %d",max,min);
return 0;
}

Ascending Order Program in C

#include<stdio.h>
#define s 100
int main(){
int n,j,a[s];
int temp=0;
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%d",&a[j]);
}
for(j=0;j<n;j++){
for(int k=j+1;k<n;k++){
if(a[j]>a[k]){
int temp=a[j];
a[j]=a[k];
a[k]=temp;
}
}
}
for(j=0;j<n;j++){
printf("%d ",a[j]);
}
}

C program to find second

largest number in array
#include<stdio.h>
#define s 100
int main(){
int n,j,a[s];
int temp=0;
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%d",&a[j]);
}
for(j=0;j<n;j++){
for(int k=j+1;k<n;k++){
if(a[j]>a[k]){
int temp=a[j];
a[j]=a[k];
a[k]=temp;
}
}
}
for(j=0;j<n;j++){
printf("%d ",a[j]);
 }
if(n>=2){
printf("\n%d",a[n-2]);
}
else{
printf("there is no sufficient elements in an array");
}
}

C program to count even and

odd elements in array
#include<stdio.h>
#define s 100
int main(){
int i,n,a[s];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int even=0;
int odd=0;
for(i=0;i<n;i++){
if(a[i]%2==0){
even+=1;
}
else{
odd+=1;
}
}
printf("even %d odd %d",even,odd);
}

C program to print even and

odd elements in array
#include<stdio.h>
#define s 100
int main(){
int i,n,a[s];
scanf("%d",&n);
for(i=0;i<n;i++){
 scanf("%d",&a[i]);
}
int even=0;
int odd=0;
for(i=0;i<n;i++){
if(a[i]%2==0){
printf("%d ",a[i]);
even+=1;
}
}
for(i=0;i<n;i++){
if(a[i]%2!=0){
printf("%d ",a[i]);
odd+=1;
}
}
printf("even %d odd %d",even,odd);
}

Program to count negative

elements in array
#include<stdio.h>
#define s 100
int main(){
int n,i,a[s];
int count=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
if(a[i]<0){
printf("%d",a[i]);
count+=1;
}
}
printf("\n%d",count);
}

#include <stdio.h>
#define MAX_SIZE 100

int main()
{
int a[MAX_SIZE], b[MAX_SIZE];
int i, n;
 scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
for(i=0; i<n; i++)
{
b[i] = a[i];
}
for(i=0; i<n; i++)
{
printf("%d\t", a[i]);
}
for(i=0; i<n; i++)
{
printf("%d\t", b[i]);
}

return 0;
}

C program to insert an element

in array
#include<stdio.h>
#define size 100
int main(){
int n,i,a[size],num,pos;
printf("no of elements in an array : ");
scanf("%d",&n);
printf("array elements : ");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("element no : ");
scanf("%d",&num);
printf("at which position : ");
scanf("%d",&pos);
for(i=n;i>=pos;i--){
a[i]=a[i-1];
}
n++;
a[pos-1]=num;
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
}
Output:
no of elements in an array : 5
array elements : 1 2 4 5 6
element no : 3
at which position : 3
123456

C program to delete element

from an array
#include<stdio.h>
#define size 100
int main(){
int n,i,pos,num,a[size];
printf("no of elements in an array: ");
scanf("%d",&n);
printf("array elments are: ");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("at which position element should be deleted: ");
scanf("%d",&pos);
if((pos<0)||(pos>n)){
printf("invalid position");
}
else{
for(i=pos-1;i<n-1;i++){
a[i]=a[i+1];
}
}
n--;
printf("elements after deleting ");
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
return 0;
}

Output:
no of elements in an array: 7
array elments are: 1 3 4 2 5 6 7
at which position element should be deleted: 5
elements after deleting 1 3 4 2 6 7
Program to count frequency of
each element of array
#include<stdio.h>
int main(){
int a[100],freq[100];
int i,j,count,n;
printf("no of elements in an array: ");
scanf("%d",&n);
printf("array elements are: ");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
freq[i]=-1;
}

for(i=0;i<n;i++){
count=1;
for(j=i+1;j<n;j++){
if(a[i]==a[j]){
count+=1;
freq[j]=0;
}
}
if(freq[i]!=0){
freq[i]=count;
}
}
printf("\nFrequency of all elements of array : \n");
for(i=0; i<n; i++)
{
if(freq[i] != 0)
{
printf("%d occurs %d times\n", a[i], freq[i]);
}
}
return 0;
}

Output:
Frequency of all elements of array :
2 occurs 2 times
3 occurs 2 times
4 occurs 1 times
1 occurs 1 times
C program to print all unique
elements in array
#include<stdio.h>
#define size 100
int main(){
int n,i,j,count,a[size],freq[size];
printf("no of elements in array: ");
scanf("%d",&n);
printf("arrays elements are: ");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
freq[i]=-1;
}

for(i=0;i<n;i++){
count=1;
for(j=i+1;j<n;j++){
if(a[i]==a[j]){
count++;
freq[j]=0;
}
}

if(freq[i]!=0){
freq[i]=count;
}
}
for(i=0;i<n;i++){
if(freq[i]==1){
printf("%d ",a[i]);
}
}
return 0;
}

Output:
no of elements in array: 7
arrays elements are: 1 2 3 4 5 5 4 6
123
C program count total duplicate
elements in array
#include<stdio.h>
#define size 100
int main(){
int i,j,count=0,a[size],n;
printf("total no of elements in an array");
scanf("%d",&n);
printf("array elements:");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}

for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(a[i]==a[j]){
count++;
break;
}
}
}
printf("no of duplicate elements in an array %d",count);
return 0;
}

Output:
total no of elements in an array5
array elements:1 2 3 2 1
no of duplicate elements in an array 2

C program to delete duplicate

elements from array
#include<stdio.h>
#define size 100
int main(){
int i,j,k,n,a[size];
printf("no of array elements");
scanf("%d",&n);
printf("array elements are: ");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
 }
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(a[i]==a[j]){
for(k=j;k<n-1;k++){
a[k]=a[k+1];
}
n--;
j--;
}

}
}
for(i=0;i<n;i++){
printf("%d",a[i]);
}
return 0;
}

C program to merge two sorted

array
#include<stdio.h>
#define size 100
int main(){
int i,j,k,n1,n2,a[size],b[size],c[size];
printf("enter no of elements in array 1 : ");
scanf("%d",&n1);
printf("elemts in arr1: ");
for(i=0;i<n1;i++){
scanf("%d",&a[i]);
}
printf("enter no of elements in array 2: ");
scanf("%d",&n2);
printf("elemts in arr2: ");
for(j=0;j<n2;j++){
scanf("%d",&b[j]);
}
c[n1+n2];
i=j=0;
for(k=0;k<n1+n2;k++){
if((i<n1)&&(j<n2)){
if(a[i]<b[j]){
c[k]=a[i];
i++;
}
 else{
c[k]=b[j];
j++;
}

}
else if(i<n1){
c[k]=a[i];
i++;
}
else{
c[k]=b[j];
j++;
}
}
printf("final sorted array");
for(k=0;k<n1+n2;k++){
printf("%d ",c[k]);
}
return 0;
}

C program to find reverse of

array
#include<stdio.h>
#define size 100
int main(){
int i,n,a[size];
printf("no of elements in an array: ");
scanf("%d",&n);
printf("array elements are:");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=n-1;i>=0;i--){
printf("%d ",a[i]);
}
return 0;
}
C program to put even and odd
elements of array in two
separate array
#include<stdio.h>
#define size 100
int main(){
int i,n,a[size],o[size],e[size];
printf("no of elements in an array: ");
scanf("%d",&n);
printf("array elements are: ");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int ec=0;
int oc=0;
for(i=0;i<n;i++){
if(a[i]%2==0){
e[ec]=a[i];
ec++;
}
else{
o[oc]=a[i];
oc++;
}
}
for(i=0;i<ec;i++){
printf("%d ",e[i]);
}
for(i=0;i<oc;i++){
printf("\n%d ",o[i]);
}

C program to search element in

an array
#include<stdio.h>
#define size 100
int main(){
int i,s,n,a[size];
 printf("no of elements in an array: ");
scanf("%d",&n);
printf("array elements are: ");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("element to be searched");
scanf("%d",&s);
int found=0;
for(i=0;i<n;i++){
if(a[i]==s){
found=1;
break;
}
}
if(found==1){
printf("%d got found at position %d",s,i+1);
}
else{
printf("element searched is not in the array");
}
}
Output:
no of elements in an array: 10
array elements are: 1 2 3 4 5 6 7 8 9 11
element to be searched7
7 got found at position 7

C program to sort array in

ascending or descending order
#include<stdio.h>
#define size 100
int main(){
int i,j,a[size],n,temp;
printf("total no of elements in an array: ");
scanf("%d",&n);
printf("array elements are: ");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(a[j]>a[i]){
temp=a[i];
a[i]=a[j];
 a[j]=temp;
}
}
}
printf("array elements in ascending order");
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(a[j]<a[i]){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\narray elements in descending order");
for(i=0;i<n;i++){
printf("%d ",a[i]);
}

Output:
total no of elements in an array: 5
array elements are: 4 8 7 3 2
array elements in ascending order2 3 4 7 8
array elements in descending order8 7 4 3 2

C program to copy all elements

of one array to another
#include<stdio.h>
#define size 100
int main(){
int i,j,n,a[size],o[size],e[size],temp,b[size];
printf("no of elements in an array:");
scanf("%d",&n);
printf("array elements :");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
 if(a[j]>a[i]){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(i=0;i<n;i++){
b[i]=a[i];

}
int ec=0;
int oc=0;
for(i=0;i<n;i++){
if(b[i]%2==0){
e[ec]=b[i];
ec++;

}
else{
o[oc]=b[i];
oc++;
}
}
printf("\neven soryted elements:");
for(i=0;i<ec;i++){
printf("%d ",e[i]);
}
printf("\nodd sorted elements:");
for(i=0;i<oc;i++){
printf("%d ",o[i]);
}
}

OUTPUT:
no of elements in an array:10
array elements :6 5 7 4 8 3 9 2 10 1

even soryted elements:2 4 6 8 10

odd sorted elements:1 3 5 7 9

C program to left rotate an array

#include<stdio.h>
#define size 10
void printarr(int a[]);
void rotatearr(int a[]);
int main(){
 int i,r,a[size];
printf("array elements: ");
for(i=0;i<size;i++){
scanf("%d",&a[i]);
}
printf("how many shifts: ");
scanf("%d",&r);
r=r%size;
printf("array elements before rotation:");
printarr(a);
for(i=1;i<=r;i++){
rotatearr(a);
}
printf("\narray elements after rotation: ");
printarr(a);
}

void printarr(int a[]){

int i;
for(i=0;i<size;i++){
printf("%d ",a[i]);
}
}

void rotatearr(int a[]){

int i;
int first=a[0];
for(i=0;i<size-1;i++){
a[i]=a[i+1];
}
a[size-1]=first;
}

Output:
array elements: 1 2 3 4 5 6 7 8 9 10
how many shifts: 5
array elements before rotation:1 2 3 4 5 6 7 8 9 10
array elements after rotation: 6 7 8 9 10 1 2 3 4 5

C program to right rotate an

array
#include<stdio.h>
#define size 10
void printarr(int a[]);
void rotatearr(int a[]);
int main(){
 int i,r,a[size];
printf("array elements: ");
for(i=0;i<size;i++){
scanf("%d",&a[i]);
}
printf("how many shifts: ");
scanf("%d",&r);
r=r%size;
printf("array elements before rotation:");
printarr(a);
for(i=1;i<=r;i++){
rotatearr(a);
}
printf("\narray elements after rotation: ");
printarr(a);
}

void printarr(int a[]){

int i;
for(i=0;i<size;i++){
printf("%d ",a[i]);
}
}

void rotatearr(int a[]){

int i;
int last=a[size-1];
for(i=size-1;i>0;i--){
a[i]=a[i-1];
}
a[0]=last;
}

OUTPUT:
array elements: 1 2 3 4 5 6 7 8 9 10
how many shifts: 3
array elements before rotation:1 2 3 4 5 6 7 8 9 10
array elements after rotation: 8 9 10 1 2 3 4 5 6 7

CHUNKING ARRAY ELEMENTS:

#include <stdio.h>

int main()
{
int n;
scanf("%d",&n);
int arr[n];
 for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
int c;
scanf("%d",&c);
int s=n/c;
int z=0;
int newarray[s][c];
printf("%d\n",s);
for(int i=0;i<s;i++)
{
for(int j=0;j<c;j++)
{
newarray[i][j]=arr[z];
z++;
}
}
for(int i=0;i<s;i++)
{
printf("[");
for(int j=0;j<c;j++)
{
printf("%d",newarray[i][j]);
if(j<c-1)
{
printf(",");
}
}
printf("]");
printf("\n");
}
int r=n%c;
if(r!=0)
{
printf("[");
for(int i=1;i<=r;i++)
{
printf("%d",arr[n-i]);
if(i<r)
printf(",");
}
printf("]");
}
}
OUTPUT:
8
1
2
3
4
5
6
7
8
3
2
[1,2,3]
[4,5,6]
[8,7]