[알고리즘] 버블 정렬(Bubble Sort)

#include<iostream>

using namespace std;

void change(int &a, int &b);

int main()
{
	int arr[5] = { 7,6,2,4,1 };
	int change_count = 0;
	int compare_count = 0;

	for (int i = 0;i < 5;i++)
	{
		cout << arr[i] << ' ';
	}
	cout << endl;

	for (int i = 0; i < 5; i++)	
	{
		for (int j = 0;j < 4-i;j++)
		{
			if (arr[j] > arr[j + 1])
			{
				change(arr[j], arr[j + 1]);
				change_count++;
				for (int k = 0;k < 5;k++)
				{
					cout << arr[k] << ' ';
				}
				cout << endl;
			}
			compare_count++;
		}
	}

	cout << "\n비교 : " << compare_count << "회\n";
	cout << "교환 : " << change_count << "회\n";

	return 0;         
}

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