Sort - Insert -java

. 1  public  class the Test {
 2      public  static  void main (String [] args) {
 . 3          int [] = {ARR. 5, 2,. 6,. 8,. 9,. 1 };
 . 4          IF (ARR == null || arr.length < 2 = ) {
 . 5              return ;
 . 6          }
 . 7          for ( int I = 0; I <arr.length -. 1; I ++ ) {
 . 8              // insertion sort: poker Similarly, a number of catch, in which position data is determined, inserted into can 
. 9              for ( int J = I; J> = 0 && ARR [J]> ARR [J +. 1]; J, ) {
 10                 swap(arr, j, j + 1);
11             }
12         }
13         for (int i = 0; i < arr.length; i++) {
14             System.out.println(arr[i]);
15         }
16     }
17 
18     private static void swap(int[] arr, int i, int j) {
19         int temp = arr[i];
20         arr[i] = arr[j];
21         arr[j] = temp;
22     }
23 }