冒泡算法

#include<stdlib.h>
#include<time.h>
#include<iostream>
using namespace std;
#define size 10
void BubbleSort(int* arr, int n)
{
	int i, j, temp;
	for (int i = 0; i < n - 1; i++)
	{
		for (int j = 0; j < n - 1 - i; j++)
		{
			if (arr[j]>arr[j + 1])
			{
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
		}
		for (int k = 0; k < n; k++)
		{
			cout << arr[k] << " ";
		}
		cout << endl;
	}
}
int main()
{
	srand(NULL);
	int arr[size];

	for (int i = 0; i < size; i++)
	{
		arr[i] = rand() / 1000 + 100;
	}
	cout << "排序前的数组:\n";
	for (int i = 0; i < size; i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl<<"排序过程:"<<endl;
	BubbleSort(arr, size);

	cout << "排序后的数组:\n";
	for (int i = 0; i < size; i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl;

	system("pause");

	return 0;
}