Bubble Sort Optimization

Bubble Sort Optimization

Bubble sort Idea
The inner loop number 22 is compared and exchanged, and the last number becomes the maximum number
Outer loop control cycle times, not the last one to participate in the exchange;

Bubbling improvements
If the inner loop has not been exchanged once, the array is ordered and the break is direct;
no need to recycle;

#include <iostream>
using namespace std;
int main ()
{
	int arr[] = {1,2,3,4,5,6,7};
	int len = sizeof (arr)/sizeof (arr[0));
	
	for (int i = 0; i < len; i++)
	{
		BOOL flag = FALSE;
		for (int j=0 J < len-i-1; J + +)
		{
			if (Arr[j] >arr[j+1])
			{
				int temp = 0;
				temp = Arr[j];
				ARR[J] = arr[j+1];
				ARR[J+1] = temp;
				Flag = true;
			}
		}
		if (false = = flag)
		{break
			;
		}
	}
	for (int i = 0; i < len;i++)
	cout << arr[i] << Endl;
	System ("pause");
}