32번 정렬알고리즘

#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 = 0; i < N; i++)
	{
		min = arr[i];
		mtemp = i;
		for (int j = i; j < N; j++)
		{
			if (min > arr[j])
			{
				min = arr[j];
				mtemp = j;
			}
		}
		temp = arr[i];
		arr[i] = arr[mtemp];
		arr[mtemp] = temp;
	}
	for (int i = 0; i < N; i++)
	{
		cout << arr[i] << " ";
	}
}