maopao.cpp

冒泡排序 我写好的 可下载即用 C++实现

#include <iostream>

using namespace std;
void bbexchange( long list[],int &number,int i, int &change);

void bubblesort(long list[],int &number)
{
	int change = 1;
	int pass = 1;
	while(pass < number&&change)
	{
		bbexchange(list,number,pass,change);
		pass++;
	}
}

void bbexchange( long list[],int &number,int i, int &change)
{
	change = 0;
	long temp;
	for(int j = number - 1; j >= i ; j--)
	{
		if(list[j -1 ] > list[j]){
			temp = list[ j -1];
			list[j -1] = list[j];
			list[j ] = temp;
			change = 1;
		}
	}
}

void main()
{
	int number;
	cin >> number;

	long list[1000];

	for(int i = 0;i < number; i++)
	{
		cin >> list[i];
	}

	bubblesort(list,number);

	for(i = 0 ; i < number; i++)
	{
		cout << list[i] << endl;
	}
}