Insertion sort (Java implementation)

Test.java

class InsertionSort{
    public void insertionsort(int[] arr, int n){
        int j, key;
        for(int i = 1; i < n; i++){
            key = arr[i];
            j = i-1;
            while(j >= 0 && key < arr[j]){
                arr[j+1] = arr[j];
                j -= 1;
            }
            arr[j+1] = key;
        }
    }
}

public class Test{
    public static void main(String[] args){
        InsertionSort ob = new InsertionSort();
        int[] arr = {5, 3, 2, 4, 1};
        int n = arr.length;
        ob.insertionsort(arr, n);
        System.out.println("After sorting");
        for(int i = 0; i < n; i++){
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }
}