冒泡排序算法的实现

#include<iostream>
using namespace std;
int main()
{
	//10个数的冒泡排序的算法:
	int arr[10] = { 0 };
	cout << "请输入10个数:" << endl;
	int i = 0;
	for (i = 0; i < 10; i++)
	{
		cin >> arr[i];
	}
	int temp = 0;
	int ret = 1;
	for (i = 0; i < 10; i++)
	{
		int j = 0;
		if (ret)
		{
			ret = 0;
			for (j = 0; j < 10 - i - 1; j++)
			{
				if (arr[j] > arr[j + 1])
				{
					temp = arr[j + 1];
					arr[j + 1] = arr[j];
					arr[j] = temp;
					ret = 1;
				}
			}
		}
		else break;
	}
	for (i = 0; i < 10; i++)
	{
		cout << arr[i] << ' ';
	}
	return 0;
}