Array Operations
Array Operations
return 0;
}
Minimum will be vice versa of it.
Sorting an array in ascending order:
#include<stdio.h>
int main()
{
int a[10],j,temp,i,n;
printf("enter nmber of elements:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]); //inputted an array
}
for(i=1;i<=n-1;i++)
{
for(j=0;j<n-1;j++)
{
if(a[j]>a[j+1]) //Comparing a[0]with a[1] if
greater then interchanging values
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;//values swapped
}
}
}
printf("sorted array:\n");
for(i=0;i<+n;i++)
{
printf("%d \n",a[i]);
}
return 0;
}
For example:
Elements are 23,12,29,5
It wil give output like
5
12
23
29
In descending order we just need to make change in
comparison condition
Like:
for(j=0;j<n-1;j++)
{
if(a[j]<a[j+1]) //Comparing a[0]with a[1] if
smaller then interchanging values
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;//values swapped
}
}
}
Searching an element from array:
#include <stdio.h>
int main()
{
int array[100], search, i, n;
printf("Enter the number of elements in array\n");
scanf("%d",&n);