The insertion sort using C++

insert_sort_mycodeschool_youtube.cpp

#include<iostream>
using namespace std;

void insertion_sort(int A[],int n){
	for(int i = 0 ; i < n ;i++){
		int j,key;     // I have taken hole as j. It's sounds better, anyways.
		key = A[i];
		j = i;
		while(j > 0 && A[j-1] > key ){
			A[j] = A[j-1];   //left shift
			j--;
		}
		A[j] = key;
	}
}

int main(){
	 
	int n;
	cin >> n;
	
	int *A = new int[n];
	for(int j = 0; j < n ; j++){
		cin >> A[j];
	}
	cout << "Initializing insertion sort" << '\n';
	cout << "-----Sorted Array-----"<< '\n';
	insertion_sort(A,n);
	for(int j = 0; j < n ; j++){
		cout << A[j] << '\n';
	}
	 
	 
	  
}