Insertion Sort Program in Java

import java.util.Scanner;

import java.util.Arrays;

class InsertionSort

{

public static void main(String args[])

{

Scanner s=new Scanner(System.in);

System.out.println("Enter a Integer Number :");

int num=s.nextInt();

int arr[]=new int[num];

for(int i=0; i<arr.length; i++)

{

arr[i]=s.nextInt();

}

InsertionSort obj=new InsertionSort();

obj.sort(arr);

System.out.println("Sorted Data :"+Arrays.toString(arr));

}

private void sort(int arr[])

{

int sortedIndex=arr[0];

for(int unsortedIndex=1; unsortedIndex<arr.length; unsortedIndex++)

{

int nextElement=arr[unsortedIndex];

for(int j=unsortedIndex; j>0; j--)

{

if(arr[j-1]>arr[j])

{

int temp=arr[j-1];

arr[j-1]=arr[j];

arr[j]=temp;

}

else

{

break;

}

}

}

}

}