Insertion sort

Insertion sort:
code:
#include<iostream>
using namespace std;
void print(int arr[],int n){
    for(int i=0;i<n;i++) cout<<arr[i]<<" ";
    cout<<endl;
}
void sort(int arr[],int n){
    for(int i=0,j;i<n-1;i++){
        if(arr[i+1]<arr[i]){
            cout<<"For "<<i<<" : ";
            print(arr,n);
            int temp=arr[i+1];
            for(j=i;j>=0&&temp<arr[j];j--){
                arr[j+1]=arr[j];
            }arr[j+1]=temp;
        }
    }
}
int main(){
    int n=6;
    int arr[n]={3,6,4,2,5,1};
    sort(arr,n);
    cout<<"Result: ";
    print(arr,n);
    return 0;
}