数组插入排序

//中心思想： 在已经排好序 的元素之间插入一个元素，用这个新插入的元素与前面已经排好序的元素进行比较，小的或大的往前移。

 

                  class    HomeWork4   {

                     public static void main (String[] arg)

                             {

                                        int[] arr1 = {19,7,28,1,6,9}; //  定义一个数组

                                        for(int i = 1;i < arr1,length; i++)    //   外循环，前面一个元素已经排好序了，所以就只有五个元素需要排序，因此只循环五次

                                               {

                                                         for(int j = i - 1; j >= 0;j--)  //   这个循环的是需要插入的元素与前面已经排好序的元素进行比较

                                                               {

                                                                        if(arr1[ j ] > arr1[ j + 1])    //  判断条件 

                                                                              {

                                                                                      int temp = arr1[ j ];

                                                                                      arr[ j ] = arr1[ j + 1];

                                                                                      arr1[ j + 1] = temp;

                                                                               }

                                                                 }

                                               }

                                                     for (int value : arr1)

                                                             {

                                                                       System.out.println(value);

                                                             }

                   }

     }