题解 | #C++选择排序#
C++选择排序
https://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 left = 0; int right = 1; int tmp; while(left <= len - 2) { tmp = left; while(right <= len - 1) { tmp = arr[right] < arr[tmp] ? right : tmp; right += 1; } swap(arr[tmp], arr[left]); left += 1; right = left + 1; } for(int i = 0; i < len; ++i) { cout<<arr[i]<<" "; } cout<<endl; return 0; }