Program of Insertion Sort in C++

// Insertion Sort
#include<iostream>
using namespace std;

void insertion(int arr[], int size)
{
int temp, j;

for(int i = 1; i <= size - 1; i++)
{
        temp=arr[i];
        j=i-1;
       
while((temp < arr[j]) && (j >= 0))
{
            arr[j+1] = arr[j];
            j = j - 1;
        }
        arr[j+1] = temp;
    }
}
int main(){

int size;

cout<<"\nEnter Size of Array : ";
cin>>size;
int arr[size];

cout<<"\nEnter "<<size<<" Elements : ";
for(int i = 0; i < size; i++){
cin>>arr[i];
}
insertion(arr,size);
cout<<"\nArray After Insertion() : ";
for(int i=0;i<size;i++){
cout<<arr[i]<<" ";
}

return 0;
}