SOURCE CODE :
===============================================================
#include<stdio.h>
#include<conio.h>
main()
{
int s,i,j,temp,a[20];
clrscr();
printf("\n========= Example of Selection Sort =======\n");
printf("\nEnter total elements: ");
scanf("%d",&s);
printf("Enter %d elements:\n",s);
for(i=0;i<s;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<s;i++)
{
for(j=i+1;j<s;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\nAfter sorting the elements are: ");
for(i=0;i<s;i++)
{
printf("\t%d",a[i]);
}
getch();
}
===============================================================
===============================================================
#include<conio.h>
main()
{
int s,i,j,temp,a[20];
clrscr();
printf("\n========= Example of Selection Sort =======\n");
printf("\nEnter total elements: ");
scanf("%d",&s);
printf("Enter %d elements:\n",s);
for(i=0;i<s;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<s;i++)
{
for(j=i+1;j<s;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\nAfter sorting the elements are: ");
for(i=0;i<s;i++)
{
printf("\t%d",a[i]);
}
getch();
}
===============================================================

No comments:
Post a Comment