#include<time.h>
#include<iostream>
using namespace std;
clock_t start;
start = clock();
int main()
{
int a[100],i,n,p,k,min,loc,temp;
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++)
{
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]; // Swapping Slctd Elt n min val
a[p]=a[loc];
a[loc]=temp;
}
cout<<"\nAfter Sorting : \n";
for(i=1;i<=n;i++)
{
cout<<a[i]<<endl;
}
double difference = (clock()-start)/(double)CLOCKS_PER_SEC;
cout<<difference;
return 0;
}
I2luY2x1ZGU8dGltZS5oPgojaW5jbHVkZTxpb3N0cmVhbT4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNsb2NrX3Qgc3RhcnQ7CnN0YXJ0ID0gY2xvY2soKTsKCiBpbnQgbWFpbigpCnsKaW50IGFbMTAwXSxpLG4scCxrLG1pbixsb2MsdGVtcDsKCmNvdXQ8PCJFbnRlciBOby4gb2YgRWxlbWVudHM9IjsKY2luPj5uOwoKY291dDw8IlxuRW50ZXIgRWxlbWVudHM9XG4iOwpmb3IoaT0xO2k8PW47aSsrKQp7CmNpbj4+YVtpXTsKfQoKZm9yKHA9MTtwPD1uLTE7cCsrKSAgICAgICAgICAgICAgCnsKbWluPWFbcF07ICAgICAgICAgICAgICAgICAgICAgICAgLy8gRWxlbWVudCBTZWxlY3Rpb24KbG9jPXA7Cgpmb3Ioaz1wKzE7azw9bjtrKyspICAgICAgICAgICAgICAvLyBGaW5kaW5nIE1pbiBWYWx1ZQp7CmlmKG1pbj5hW2tdKQp7Cm1pbj1hW2tdOwpsb2M9azsKfQp9Cgp0ZW1wPWFbcF07ICAgICAgICAgICAgICAgICAgICAgICAgLy8gU3dhcHBpbmcgU2xjdGQgRWx0IG4gbWluIHZhbAphW3BdPWFbbG9jXTsKYVtsb2NdPXRlbXA7Cgp9Cgpjb3V0PDwiXG5BZnRlciBTb3J0aW5nIDogXG4iOwoKZm9yKGk9MTtpPD1uO2krKykKewpjb3V0PDxhW2ldPDxlbmRsOwp9CmRvdWJsZSBkaWZmZXJlbmNlID0gKGNsb2NrKCktc3RhcnQpLyhkb3VibGUpQ0xPQ0tTX1BFUl9TRUM7CmNvdXQ8PGRpZmZlcmVuY2U7CnJldHVybiAwOwp9