SELECTION SORT The basic idea of selection sort

SELECTION SORT The basic idea of selection sort is to select the smallest and swap

Function void selsort(int a[], int n) { int I, temp, small pos; for(i=0; i<n; i++) { small=a[i]; for(j=i; j<n; j++) { if(a[j]<small) { small=a[j]; pos=j; } } temp=a[i]; a[i]=a[pos]; a[pos]=temp; } }

To sort : 12 12 21 21 3 3 45 45 1 1 16 16 8 8

for(i=0; i<n; i++) { small=a[i]; for(j=0 j<n; j++) { if(a[j]<small) { small=a[j]; pos=j; } } small=12 12 < 12 false skip true statements increment j.

for(i=0; i<n; i++) { small=a[i]; for(j=1; j<n; j++) { if(a[j]<small) { small=a[j]; pos=j; } } small=12 21 < 12 false skip true statements increment j.

for(i=0; i<n; i++) { small=a[i]; for(j=2; j<n; j++) { if(a[j]<small) { small=a[j]; pos=j; } } small=12 3 < 12 true small=3 pos=2 increment j.

for(i=0; i<n; i++) { small=a[i]; for(j=3; j<n; j++) { if(a[j]<small) { small=a[j]; pos=j; } } small=12 45 < 3 false small=3 pos=2 increment j.

for(i=0; i<n; i++) { small=a[i]; for(j=4; j<n; j++) { if(a[j]<small) { small=a[j]; pos=j; } } small=12 1 < 3 true small=1 pos=4 increment j.

for(i=0; i<n; i++) { small=a[i]; for(j=5; j<n; j++) { if(a[j]<small) { small=a[j]; pos=j; } } small=12 16 < 1 false small=1 pos=4 increment j.

for(i=0; i<n; i++) { small=a[i]; for(j=6; j<n; j++) { if(a[j]<small) { small=a[j]; pos=j; } } J loop gets over. small=12 8 < 1 false small=1 pos=4 increment j.

temp=a[i]; a[i]=a[pos]; a[pos]=temp; temp=12 a[0]=a[4] i. e. a[0]=1 a[4]=temp i. . e. a[4]=12 Thus the above process is repeated until the array is sorted Completely,

1 21 3 45 12 16 8

1 3 21 45 12 16 8

1 3 8 45 12 16 21

1 3 8 12 45 16 21

1 3 8 12 16 45 21