Insertion Sort

import java.io.*;
import java.util.*;

public class Solution {

    public static void insertionSort(int[] ar)
    {       
        int shifts = 0;
        for(int i = 1;i<ar.length;i++){
            int temp = ar[i];
            int j = i-1;
            for(;j>=0 && ar[j]>temp;j--){
                ar[j+1] = ar[j];
                shifts++;
            }
            ar[j+1] = temp;           
        }
        printArray(ar);
    }  
    
    
      
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
       int s = in.nextInt();
       int[] ar = new int[s];
       for(int i=0;i<s;i++){
            ar[i]=in.nextInt(); 
       }
       System.out.println(insertionSortPart2(ar));    
                    
    }    
    private static void printArray(int[] ar) {
      for(int n: ar){
         System.out.print(n+" ");
      }
        System.out.println("");
   }
}