冒泡排序
#include <iostream>
#include <vector>
using namespace std;
void bubbleSort(vector<int> &array)
{
int len = array.size();
for(int i=0;i<len-1;i++)
{
bool exchange = false;
for(int j=0;j<len-1-i;j++)
{
if(array[j]>array[j+1])
{
int temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
exchange = true;
}
}
if(exchange = false)
return;
}
}
int main(int argc, char** argv) {
vector<int> array;
for(int i=0;i<10;i++)
{
array.push_back(5-i);
cout<<5-i<<',';
}
cout<<endl;
bubbleSort(array);
for(int i=0; i<10; i++)
cout<<array[i]<<',';
return 0;
}