SELECTION SORT PROGRAM

SELECTION SORT PROGRAM


 #include <stdio.h>

void main()

{


int i, j, n, pos, temp, a[100];

printf("Enter number of elements");

scanf("%d",&n);

printf("Enter elements\n");

for(i=0;i<n;i++)

{

scanf("%d",&a[i]);

}

for (i=0; i< n-1; i++)


{

pos=i;                 // Position for fixing smallest element of an array

for(j=i+1; j<n; j++)

{


if(a[pos]>a[j])           //Searching for smallest element from rest of array

pos=j;


}

if(pos!=i)            //Exchange only when smallest element’s position is different

{


temp=a[i];

a[i]=a[pos];

a[pos]=temp;


}

}

printf("Enter elements\n");

for(i=0; i<n; i++)

printf("%d\t",a[i]);

}

Comments