排序算法（四） 插入排序

package study;public class SortNumberTest {           public static void main(String[] args) {        Test1();    }    public static void Test1(){        System.out.println("插入排序");    int[] numbers4={7,6,5,8,1,3,8,4,2,9};    insertSort(numbers4);    System.out.println("...................................");        }        //插入排序        public static void insertSort(int[] numbers) {           print(numbers);        int temp, j;           for (int i = 1; i < numbers.length; i++) {               temp = numbers[i];               for (j = i; j > 0 && temp > numbers[j - 1]; j--) {             numbers[j] = numbers[j - 1];                    System.out.println("op1:numbers["+j+"]="+numbers[j - 1]);            }            numbers[j] = temp;               System.out.println("op2:numbers["+j+"]="+temp);            print(numbers);        }       }           private static void  print(int[] numbers){    for (int i = 0; i < numbers.length; i++) {           System.out.print(numbers[i]+" ");        }        System.out.println();    }    }