Write a ‘C’ program to sort an array elements using Select Sort technique.
#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],n,i,j,t,s ;
clrscr();
printf("\n\n Enter how many number u want:-\n\n");
scanf(" %d",&n);
printf("\n\n Enter %d numbers:-",n);
for(i=0;i<n;i++)
{
scanf(" %d",&a[i]);
}
printf("\n\n Before sorting numbers are:-\n\n");
for(i=0;i<n;i++)
{
printf("\n %d",a[i]);
}
for(i=0;i<n-1;i++)
{
s=i;
for(j=i+1;j<n;j++)
{
if(a[s]>a[j])
{
s=j;
}
}
if(i!=s)
{
t=a[i];
a[i]=a[s];
a[s]=t;
}
}
printf("\n\n After sorting numbers are:-\n\n");
for(i=0;i<n;i++)
{
printf("\n %d",a[i]);
}
getch();
}
/* OUTPUT
Enter how many number u want:-
5
Enter 5 numbers:-5
6
1
0
10
Before sorting numbers are:-
5
6
1
0
10
After sorting numbers are:-
0
1
5
6
10 */
#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],n,i,j,t,s ;
clrscr();
printf("\n\n Enter how many number u want:-\n\n");
scanf(" %d",&n);
printf("\n\n Enter %d numbers:-",n);
for(i=0;i<n;i++)
{
scanf(" %d",&a[i]);
}
printf("\n\n Before sorting numbers are:-\n\n");
for(i=0;i<n;i++)
{
printf("\n %d",a[i]);
}
for(i=0;i<n-1;i++)
{
s=i;
for(j=i+1;j<n;j++)
{
if(a[s]>a[j])
{
s=j;
}
}
if(i!=s)
{
t=a[i];
a[i]=a[s];
a[s]=t;
}
}
printf("\n\n After sorting numbers are:-\n\n");
for(i=0;i<n;i++)
{
printf("\n %d",a[i]);
}
getch();
}
/* OUTPUT
Enter how many number u want:-
5
Enter 5 numbers:-5
6
1
0
10
Before sorting numbers are:-
5
6
1
0
10
After sorting numbers are:-
0
1
5
6
10 */