题解 | #C++冒泡排序#
C++冒泡排序
http://www.nowcoder.com/practice/eb72dada09de43ceacf93f9a143ee321
#include 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];
}
for(int i = 1; i < len; i++){
for(int j = 0; j < len - i; j++){
if( arr[j] > arr[j+1]){
int tem = arr[j];
arr[j] = arr[j+1];
arr[j+1] = tem;
}
}
}
for (int i = 0; i < len; i++) {
cout << arr[i] << " ";
}
return 0;
}