运行截图:
下面是完整代码:
#include <iostream>
#include <stdio.h>
using namespace std;
//冒泡排序就是每次找到最大/最小的数
void mp() {
int m[] = {9,8,7,6,5};
int len = sizeof(m) / sizeof(m[0]);
for (int i = 0; i < len; i++) {
cout << m[i] << " ";
}
cout << endl;
//正序
for (int i = 0; i < len - 1; i++) {
// i 和 i+1 之后的数进行比较
for (int j = i + 1; j < len; j++) {
if (m[i] > m[j]) {
int t = m[i];
m[i] = m[j];
m[j] = t;
}
}
}
for (int i = 0; i < len; i++) {
cout << m[i] << " ";
}
}
int main() {
mp();
return 0;
}