容器类型冒泡排序<vector>
#include <iostream> #include <vector> using namespace std; int main(){ vector<int> a; a.push_back(1); a.push_back(3); a.push_back(2); for(int i=0;i<a.size();i++){ for(int j=i+1;j<a.size();j++){ if(a[j]>a[i]){ swap(a[j],a[i]); } } } cout<<"从大到小是:"<<endl; for(int i=0;i<a.size();i++){ cout<<a[i]<<" "; } cout<<endl<<"从小到大是:"<<endl; for(int j=a.size()-1;j>=0;j--){ cout<<a[j]<<" "; } return 0; }