【排序算法】之冒泡排序

//C++ Builder 6.0

//C++ Language

//---------------------------------------------------------------------------
#include <iostream>
#pragma hdrstop
using namespace std;
//---------------------------------------------------------------------------

#pragma argsused
int main(int argc, char* argv[])
{
  	void Bubble_sort(int *x, int n);

  	int num_x[]={12,34,5,7,90,30,44,6,100,6,5}; //待排序数组
        int len_x=11;//待排序数组长度

        Bubble_sort( num_x, len_x);

        for (int i=0; i<len_x; i++) //打印排序结果
        {
        	cout<<num_x[i]<<',';
        }
        cout<<"End";
        
	return 0;
}
//---------------------------------------------------------------------------
//冒泡排序：从小到大
//形参说明：x-数组；n-数组x的长度
void Bubble_sort(int *x, int n)
{
	int i, j, t;
        for (i=n-1; i>0; i--)//每轮比较x[0]~x[i]，每轮比较结束x[i]是该轮中最大数
        {
          	for (j=0; j<i; j++)//每一轮中比较相邻两数大小
                {
                  	if ( *(x+j) > *(x+j+1) ) //前大后小，则两两交换
                        {
                        	t = *(x+j);
                                *(x+j) = *(x+j+1);
                                *(x+j+1) = t;
                        }
                }
        }

}
//---------------------------------------------------------------------------