【猪脑子系列】又忘了插入排序

    void InsertSort(int []arr)

    {

        for (inti = 1; i < arr.length;i++) {

            for (intj = i-1; j >0; j--) {

                if(arr[i]>arr[j])

                {

                    inttemp =arr[i];

                    arr[i] =arr[j];

                    arr[j] =temp;

                }

            }

        }

    }

    别忘了基本的插入排序就是相邻的比较然后交换。不要被希尔和快排搞混