题解 | #C++选择排序#
C++选择排序
https://www.nowcoder.com/practice/3b6175426e704c0b9461628b2278631b
#include<iostream>
using namespace std;
int main() {
int a[6];
int len = sizeof(a) / sizeof(int);
int temp ;//最小位置
for (int i = 0; i < len; i++) {
cin >> a[i];
}
for (int i = 0; i < len; i++) {
temp = a[i];
for (int j = i + 1; j < len; j++) {
if (a[j] < temp)
swap(temp, a[j]);
a[i] = temp;
}
cout <<temp<< " ";
}
return 0;
}
#打卡#
查看2道真题和解析
