冒泡排序

 public void sz()
    {
        int[] nums = { 1, 5, 8, 9, 3, 6, 7 };
        for (int i = 0; i < nums.Length-1; i++)
        {
            for (int j = i+1; j < nums.Length; j++)
            {
                int temp = 0;
                if (nums[i] < nums[j])
                {
                    temp = nums[i];
                    nums[i] = nums[j];
                    nums[j] = temp;
                }
            }
        }
        for (int m = 0; m < nums.Length; m++)
        {
            Response.Write(nums[m].ToString()+"<br>");
        }
    }