题解 | #C++冒泡排序#
C++冒泡排序
https://www.nowcoder.com/practice/eb72dada09de43ceacf93f9a143ee321
#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]; } int temp; // write your code here...... //最大的放最后 for (int i=0;i<6;i++){ for(int j=0;j<6-i-1;j++){ if(arr[j+1]<arr[j]){ temp=arr[j+1]; arr[j+1]=arr[j]; arr[j]=temp; } } } for (int i=0;i<6;i++){ cout<<arr[i]<<" "; } return 0; }