Untitled

// insertion sort

#include <iostream>
using namespace std;

void insertSort(int arr[], int n)
{
    for (int i=0; i<n; i++)
    {
    int key = arr[i];
    int j = i-1;
    
    while(j>=0 && arr[j]>key)
    {
        arr[j+1]=arr[j];
        j--;
    }
    arr[j+1]=key;
    }
}
void printArray(int arr[], int n)
{
    for (int i=0; i<n; i++)
    cout<<arr[i]<<" "<<endl;
}
int main()
{
    int n;
    cout<<"no. of elements: ";
    cin>>n;
    
    int arr[n];
    cout<<"enter"<<n<<"elements:";
    for(int i=0; i<n; i++)
    {
        cin>>arr[i];
    }
    insertSort(arr, n);
    
    cout<<"sorted array: ";
    printArray(arr, n);
    return 0;
}