36번 정렬알고리즘

#include<iostream>
#include<vector>
using namespace std;
int main()
{
	int temp = 0;
	int N=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 < i; j++)
		{
			if (arr[i] < arr[j])
			{
				temp = arr[j];
				arr[j] = arr[i];
				arr[i] = temp;

			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		cout << arr[i] << " ";
	}
}