插入式排序算法

private int[] paixu(int pn, int[] lnum)
        {
            int max = lnum.Length;
            int[] rnum = new int[max];
            if (pn > lnum[max - 1])
            {
                for (int i = 0; i < max; i++)
                {
                    if (pn > lnum[i])
                    {
                        rnum[i] = pn;
                        while (i < max - 1)
                        {
                            rnum[i + 1] = lnum[i];
                            i++;
                        }
                        break;
                    }
                    else
                    {
                        rnum[i] = lnum[i];
                    }
                }
            }
            else
            {
                rnum = lnum;
            }
            return rnum;
        }