Insertion Sort (JAVA)

public class InsertionSort{

    public static void main (String [] args){

        int [] ar = {213,34,3,23,2,231,1,323,35,43,3,4,56,0};

        for (int i = 1; i < ar.length; ++i){

            int key = ar[i];

            int j = i - 1;

            while (j >= 0 && key < ar[j]){

                  ar[j+1] = ar[j];

                  --j;

            }

            ar[j+1] = key;

        }

        for (int i = 0; i < ar.length; i++)
            System.out.println(ar[i]);

    }

}