题解 | #C++选择排序#
C++选择排序
http://www.nowcoder.com/practice/3b6175426e704c0b9461628b2278631b
#include <iostream>
using namespace std;
int main() {
int arr[6] = { 0 };
int len = sizeof(arr) / sizeof(int);
for (int i = 0; i < len; i++) {
cin >> arr[i];
}
// write your code here......
int max = arr[0], index = 0;
for (int j = len; j > 1; j--) {
for (int i = 0; i < j; i++) {
if (arr[i]>max)
{
index = i;
max = arr[i];
}
}
swap(arr[j - 1], arr[index]);
max = arr[0];
index = 0;
}
for (int i = 0; i < len; i++) {
cout << arr[i] << ' ';
}
return 0;
}