[编程入门]选择排序-题解（C++代码）

解题思路:

注意事项:

参考代码:

#define _CRT_SECURE_NO_WARNINGS

#include<iostream>

#include<cstdio>

#include<iomanip>

#include<cmath>

#include<string>

#include <vector>

#include<algorithm>

#include<stdio.h>

#include<vector>

#include<cmath>

#include<queue>

using namespace std;

int main()

{

int  min = 999,j,k,temp;

int a[10] = { 0 };

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

cin >>a[i];

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

{

k = i;

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

{

if (a[k] > a[j])

k = j;

}

temp = a[i];

a[i] = a[k];

a[k] = temp;

}

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

cout << a[i] << endl;

return 0;

}