冒泡排序法

#include<iostream>

#include<vector>

using namespace std;

int main(){

         int n,x;

         cout<<"请输入要比较的数的个数：";

         cin>>n;

         vector<int> v(n);

         for(int i=0;i<v.size();i++)

         cin>>v[i];

         for(int o=v.size()-1;o>0;o--){

                   for(int i=0;i<o;i++)

                   if(v[i]<v[i+1]){

                   x=v[i];

                   v[i]=v[i+1];

                   v[i+1]=x;  

                   }

         for(int j=0;j<v.size();j++)

         cout<<v[j]<<"";        

         }

        

         system("pause");

         return 0;

}