simple program using insertion sort in data structure

 //insertion sort

 #include<iostream>

 using namespace std;

 int main()

 {

  int n,key,j,elements;

  cout<<"Enter the Size of Array here:";

  cin>>n;

  int arr[n];

  cout<<"Enter Element in Array:"<<endl;

  for(int i=1;i<n;i++)

  {

  cin>>arr[i];

}

  cout<<"\t\tBefore Sorting"<<endl;

  cout<<"[";

  for(int i=0;i<n;i++)

  {

  cout<<arr[i]<<",";

}

cout<<"]";

//loop for passes

for(int i=1;i<=n-1;i++)

{

key=arr[i];

j=i-1;

//loop for each pass

while(j>=0 && arr[j]>key)

{

arr[j+1]=arr[j];

j--;a

}

arr[j+1]=key;

}

cout<<endl<<endl;

cout<<"\t\tAfter Sorting"<<endl;

cout<<"[";

for(int i=0;i<n;i++)

  {

  cout<<arr[i]<<",";

}

cout<<"]";

 }