34번 정렬알고리즘

#include<iostream>
#include<vector>
using namespace std;

int main() {
	int N = 0;
	int mtemp = 0;
	int min = 0;
	int temp = 0;
	cin >> N;
	vector<int> arr(N);
	for (int i = 0; i < N; i++)
	{
		cin >> arr[i];
	}

	for (int i = 1; i < N; i++)
	{
		for (int j = 0; j < N-i; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		cout << arr[i] << " ";
	}
}