冒泡排序

#include<iostream>
using namespace std;
void BubbleSort(int *arr,int len)
{
	int i, j,temp;
	int flag = 0;
	for (i = 0; i <= len-1; i++)
		for (j = 0; j < len -1-i ; j++)
			if (arr[j] > arr[j + 1]) {
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
				flag = 1;
			}
	//判断标志位是否为0，如果为0，说明后面的元素已经有序，就直接return
	if (flag == 0)
	{
		return;
	}
}
int main()
{
	/*int n=7;
	int arr[7];
	cout << "Input number:";
	for (int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	cout << endl;*/
	int arr[7] = { 1,23,5,8,12,4,3 };
	cout << "初始序列为：";
	for (int i = 0; i < 7; i++) {
		cout << arr[i] << " ";
	}
	cout << endl;
	BubbleSort(arr, 7);
	cout << "冒泡排序后的顺序为：";
	for (int i = 0; i<7; i++) {
		cout << arr[i] <<" ";
	}
	cout << endl;
	system("pause");
	return 0;
	}