冒泡排序

#include<iostream>
#include<vector>
using namespace std;
int main()
{
    vector<int> vint;
    int val;
    cout << "Enter some numbers : " << endl;
    while(cin.peek() !='\n' && cin >>val)
    {
        vint.push_back(val);
    }
    for(vector<int>::iterator iter1=vint.begin();
        iter1 != vint.end()-1;iter1++)
    {
        for(vector<int>::iterator iter2=iter1+1;
            iter2 != vint.end();iter2++)
        {
            int v1,v2;
            v1=*iter1;
            v2=*iter2;
            if(v1 > v2)
            {
                v1^=v2;
                v2^=v1;
                v1^=v2;
                *iter1=v1;
                *iter2=v2;
            }
        }
    }
    cout << "Sorted :" << endl;
    int count=0;
    for(vector<int>::iterator iter=vint.begin();
            iter != vint.end();iter++)
    {
        cout << *iter << "\t";
        count++;
        if(count % 5 ==0)
            cout << endl;
    }
    cout << endl;
    return 0;
}