package lec1;
public class intersectionofarrays{
public static void insertionSort(int[] arr){
//write your code here
int j=0,k=0;
for(int i=0;i<arr.length;i++)
{
k=arr[i];
j=i-1;
while(k<arr[j] && (j>=0))
{
arr[j+1]= arr[j];
j--;
}
arr[j+1]=k;
}
for(int i=0;i<arr.length;i++)
{
System.out.print(arr[i]+" ");
}
}
public static void main(String[] args) {
int ar1[]= {1 ,2 ,4 ,1, 1, 1};
insertionSort(ar1);
}
}