DS1 1
DS1 1
//Traversing of array
#include<stdio.h
> int main()
{ int
a[5],i;
printf("Enter five
elements:");
for(i=0;i<5;i++) {
scanf("%d",&a[i]);
}
printf("Array elements
are:\n");
for(i=0;i<5;i++) {
printf("%d\t",a[i]);
}
return 0;
}
//Min number
#include<stdio.h
> int main()
{
int
a[5],i,min;
printf("Ente
r 5
elements:");
for(i=0;i<5;i++) {
scanf("%d",&a[i]);
}
min=a[0];
for(i=0;i<5;i++) {
if(min>a[i]) {
min=a[i]; } }
printf("Minimum
element is %d\n",min);
return 0;
}
3. C program for sorting given 5 numbers.
//sorting
#include<stdio.h
> int main()
{
int a[5],i,j,temp;
printf("Enter 5
elements:");
for(i=0;i<5;i++)
scanf("%d",&a[i]);
for(i=0;i<5;i++) {
for(j=i+1;j<5;j++)
{
if(a[i]>a[
j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("Sorted elements are:");
for(i=0;i<5;i++)
{
printf("%d\n",a[
i]); } return 0;
}
4. C program for inserting element in array at specified position.
// Insertion
#include<stdio.h>
int main()
{
int a[10],i,p,n,data;
printf("Enter size of
array:"); scanf("%d",
&n);
printf("Enter array
elements:");
for(i=0;i<n;i++) {
scanf("%d",&a[i]); }
}
printf("\nArray after
insertion:\n");
for(i=0;i<n;i++) {
printf("%d\n",a[i]); }
return 0;
}
//deletion
#include<stdio.h>
int main()
{
int a[10],i,p,n,k;
printf("Enter the size of
array:");
scanf("%d", &n);
k=p-1;
if(p<=0 ||
p>=n)
{
printf("Invalid\n");
else{ for(i=k;i<n-
1;i++) {
a[i]=a[i+1]; }
for(i=0;i<n-1;i++) {
printf("%d\t",a[i]); }
return 0;
}
6. C program form reversing array elements.
//reversing array
#include<stdio.h
> int main()
{
int a[10],i,j,n,temp;
printf("Enter size of
array:"); scanf("%d",
&n);
for(i=0,j=n-1;i<n/2;i++,j--
) { temp=a[i]; a[i]=a[j];
a[j]=temp; } printf("Array
after riversing:\n");
for(i=0;i<n;i++) {
printf("%d\t",a[i]);
}
printf("\n");
return 0;