蓝桥杯算法提高VIP-选择排序 （C++代码）

解题思路:





注意事项:





参考代码:

#include <deque>

#include <algorithm>

#include <iostream>

#include <cstdlib>

#include <iterator>

#include <iomanip>

#include <numeric>

#include <sstream>

#include <string>

#include <cmath>

#include <string.h>

using namespace std;

int main()

{

deque<int> q;

int n;

cin>>n;

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

{

int num;

cin>>num;

q.push_back(num);

}

int pp,i,j;

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

{

int temp=i;

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

{

if(q[temp]>q[j])

{

temp=j;

}

}

pp=q[i];

q[i]=q[temp];

q[temp]=pp;

cout<<"swap(a["<<i<<"], a["<<temp<<"]):";

copy(q.begin(),q.end(),ostream_iterator<int>(cout," "));

cout<<endl;

}

cout<<"swap(a["<<n-1<<"], a["<<n-1<<"]):";

copy(q.begin(),q.end(),ostream_iterator<int>(cout," "));

return 0;

}