数据结构与算法编程题56-冒泡排序

#include 
using namespace std;

void swap(int& a, int& b)
{
	int temp = 0;
	temp = a;
	a = b;
	b = temp;
}

void print_array(int a[], int n)
{
	for (int i = 0; i < n; i++)
	{
		cout << a[i] << "  ";
	}
	cout << endl;
}

void bobble_sort(int a[], int n)
{
	int i = 0, j = 0;
	int flag = 0;
	for (i = 0; i < n-1; i++)
	{
		flag = 0;
		for (j = 0; j < n-1-i; j++)
		{
			if (a[j] > a[j + 1])
			{
				swap(a[j], a[j + 1]);
				flag = 1;
			}
		}
		if (flag == 0)
		{
			break;
		}
		print_array(a, n);
	}
}
int main(void)
{
	int a[] = { 6,12,7,15,2,5 };
	bobble_sort(a, 6);
	return 0;
}