Selection Sort

#include<iostream>

#include<conio.h> 

using namespace std;

void main()

{

int a[100],i,n,p,k,min,loc,temp;

cout<<"\n------------ SELECTION SORT ------------ \n\n";

cout<<"Enter No. of Elements=";

cin>>n;

cout<<"\nEnter Elements=\n";

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

{

cin>>a[i];

}

for(p=1;p<=n-1;p++)              // Loop for Pass

{

min=a[p];                        // Element Selection

loc=p;

for(k=p+1;k<=n;k++)              // Finding Min Value

{

if(min>a[k])

{

min=a[k];

loc=k;

}

}

temp=a[p];                        // Swap Selected Element and Min Value

a[p]=a[loc];

a[loc]=temp;

}

cout<<"\nAfter Sorting : \n";

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

{

cout<<a[i]<<endl;

}

getch();

}

Output :-

Posted in: C++, Sorting in C++