//冒泡排序
#include <iostream>
void BubbleSort(int arr[], int len) {
int i, j;
for (i = 0; i < len - 1; i++)
for (j = 0; j < len - 1 - i; j++)
if (arr[j] > arr[j + 1])
std::swap(arr[j], arr[j + 1]);
}
int main() {
int arr[] = {61, 17, 29, 22, 34, 60, 72, 21, 50, 1, 62};
//上面大括号里面输数
int len = (int)sizeof(arr) / sizeof(*arr);
BubbleSort(arr, len);
for (int i = 0; i < len; i++)
std::cout << arr[i] << ' ';
std::cout << std::endl;
return 0;
}