Selection Sort - Implementation with C++

/* Bismillahir Rahmanir Rahim Implementation of Selection-Sort using C++ */ #include<bits/stdc++.h> using namespace std; int main(){ int ar[1000], i, j, n, temp, loc, mn; cin>>n; // Enter the number of element for(i=0; i<n; i++) cin>>ar[i]; // all elements for(i=0; i<n-1; i++){ mn=ar[i]; // let, its the minimum loc=i; // location of minimum for(j=i+1; j<n; j++){ if(ar[j]<mn){ mn=ar[j]; // minimum updated loc=j; // location of minimum } } temp=ar[i]; ar[i]=ar[loc]; ar[loc]=temp; } for(i=0; i<n; i++) cout<<ar[i]<<" "; cout<<endl; return 0; }