冒泡排序_C++

#include <iostream>
using namespace std;

int Random_array(int* a, int n)
{
	srand((unsigned int)time(NULL));
	for (int i = 0; i < n; i++)
		a[i] = rand() % 100;
	return *a;
}

void Print_array(int* a, int n)
{
	for (int i = 0; i < n; i++)
		printf("%d ,", a[i]);
	printf("\n");
}

void swap(int& a, int& b)
{
	int temp = a;
	a = b;
	b = temp;
}
void Bubble_sort(int* a, int n)
{
	if (n < 2)
		return;
	for (int i = n - 1; i >= 0; i--)
	{
		for (int j = 0; j < i; j++)
		{
			if (a[j] > a[j + 1])
				swap(a[j], a[j + 1]);
		}
	}
}
int main()
{
	int a[10] = {};
	Random_array(a, 10);
	Print_array(a, 10);
	Bubble_sort(a, 10);
	Print_array(a, 10);
	return 0;
}