题解 | #C++冒泡排序#

#include <algorithm>
#include <cstddef>
#include <cstdio>
#include <iostream>
using namespace std;
 int cmp(const void*a,const void*b)
 {
      return *(int*)a-*(int*)b;
 }
int main() {

    int arr[6] = { 0 };
    int len = sizeof(arr) / sizeof(int);
    
    for (int i = 0; i < len; i++) {
        cin >> arr[i];
    }
    qsort(arr,6,sizeof(int),cmp);
    for (int i = 0; i < len; i++) {
        printf("%d ",arr[i]);
    }
    return 0;
}