冒泡排序,顾名思义,其基本思想是:
比较前后两位,如果为逆序对,则交换两位。
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int s[n];
for ( int i = 0;i < n;i++){
cin >> s[i];
}
for (int i = 0; i < n - 1; i++)
{
for (int j = 0; j < n - i - 1; j++)
{
if (s[j] > s[j + 1])
{
int temp = s[j];
s[j] = s[j + 1];
s[j + 1] = temp;
}
}
}
cout<<"排序结果:";
for(int i = 0;i<n;i++){
cout << s[i] <<" ";
}
}