冒泡排序

冒泡排序，顾名思义，把最轻的向上浮动。对应的把最小的数向上浮动，

对应到数列中就是：从后向前，当list[n] < list[n-1]时交换他们的值。

#include<iostream>
using namespace std;

void swap(int& small, int& big)
{
     int temp;
     temp = small;
     small = big;
     big = temp;
}

void maopao(int arr[], int size )
{
     int len = size;
     int i, j;
     for ( i = 0; i < len; i++)
     	   for (j = len -1; j > i; j-- )
     	   	    if (arr[j] < arr[j-1])
     	   	    	 swap(arr[j], arr[j-1]);
}

int main()
{
    	    int arr[10] = {10,15,9,2,18,6,90,35,42,100};
    	    maopao(arr, 10);
    	    for (int i = 0; i < 10; i++ )
    	    cout << arr[i] << " ";
    	    
    	    cin.get();
    	    
    	    return 0;
}