五、插入排序

 public void InsertSort(int[] s)
    {
        if (s.Length < 2)
            return;
        int tmp;
        for (int i = 1; i < s.Length; i++)
        {
            tmp = s[i];
            for (int j = i-1; j >=0; j--)
            {
                if (tmp < s[j])
                {
                    s[j + 1] = s[j];
                    s[j] = tmp;
                }
                else
                    break;
            }
        }
    }