常用的排序方法

1.冒泡法排序

            int tmp = 0;
            for (int i = 0; i < arrI.Length - 1; i++)
            {
                for (int j = arrI.Length - 1; j > i; j--)
                {
                    if (arrI[j] < arrI[j - 1])
                    {
                        tmp = arrI[j];
                        arrI[j] = arrI[j - 1];
                        arrI[j - 1] = tmp;
                    }
                }
            }

2.选择法排序

            int tmp = 0;
            int k = 0;
            for (int i = 0; i < arrI.Length - 1; i++)
            {
                k = i;
                for (int j = i; j < arrI.Length; j++)
                {
                    if (arrI[j] < arrI[k])
                    {
                        k = j;
                    }
                }
                tmp = arrI[i];
                arrI[i] = arrI[k];
                arrI[k] = tmp;
            }

3.直接插入排序

            int tmp = 0;
            for (int i = 1; i < arrI.Length; i++)
            {
                tmp = arrI[i];
                int j = i;
                while (j > 0 && arrI[j - 1] >= tmp)
                {
                    arrI[j] = arrI[j - 1];
                    j--;
                }
                arrI[j] = tmp;
            }

4.改良法排序

            for (int i = 0; i < arrI.Length - 1; i++)
            {
                for (int j = i; j >= 0; j--)
                {
                    if (arrI[j + 1] >= arrI[j])
                    {
                        break;
                    }
                    temp = arrI[j + 1];
                    arrI[j + 1] = arrI[j];
                    arrI[j] = temp;
                }
            }