/*BUBBLE SORT (ASCENDING AND DESCENDING ORDER ORDER) */
#include<stdio.h>
void main()
{
int n,a[1000],i,j,t;
printf("enter the number of numbers that are to be sorted\n");
scanf("%d",&n);
printf(" enter the elements of the array\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(j=0;j<n-1-i;j++)
if(a[j]>a[j+1])
{
t=a[j+1];
a[j+1]=a[j];
a[j]=t;
}
}
printf("\n ASCENDING ORDER :\n"); for(i=0;i<n;i++)
printf(" %d ",a[i]);
printf("\n DESCENDING ORDER:\n"); for(i=n-1;i>=0;i--)
printf(" %d ",a[i]);
}
Laplace transforms pdf
CLICK THE LINK BELOW TO DOWNLOAD LAPLACE TRANSFORMS IMPORTANT FORMULAS IN THE FORM OF PDF
CLICK HERE
Sunday, 24 July 2016
Bubble sort
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment