Insertion Sort!!

#include<iostream>
using namespace std;

void input(int arr[], int N)
{
	for(int i = 0 ; i < N ; i++)
	{
		cin >> arr[i];
	}
}

int largestIndex(int arr[] , int N)
{
    int indexlargestElement = 0 , i = 0;
    for(i = 0 ; i < N ; i++)
    {
    	if(arr[i] > arr[indexlargestElement])
    		indexlargestElement = i;
    }
    
    return indexlargestElement;
}

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

void selectionSort(int arr[] , int N)
{
	for(int curIteration = 0 ; curIteration < N - 1; curIteration++)
	{
		int indexlargestElement = largestIndex(arr , N - curIteration);
		swap(arr[indexlargestElement] , arr[N - curIteration - 1]);
	}
}


int main()
{
	int N;
	cin >> N;

	int arr[N];

	input(arr , N);

	selectionSort(arr , N);

	output(arr , N);
}