#include <iostream> using namespace std; int main() { int arr[9] = {4,2,8,0,5,7,1,3,9}; cout<<"排序前"<<endl; for (int i =0;i<9;i++) { cout<<arr[i]<<" "; } cout <<endl; for (int i = 0;i<9-1;i++) { for (int j=0;j<9-i-1;j++) { if (arr[j]>arr[j+1]) { int temp = arr[j]; arr[j] = arr[j+1]; arr[j+1]= temp; } } } cout<<"排序后"<<endl; for (int i =0;i<9;i++) { cout<<arr[i]<<" "; } cout <<endl; return 0; }
排序前 4 2 8 0 5 7 1 3 9 排序后 0 1 2 3 4 5 7 8 9
c++冒泡排序
于 2022-04-27 15:12:18 首次发布