冒泡算法

    //数字交互法应用
    protected void Button1_Click(object sender, EventArgs e)
    {
        int[] numbers = new int[5] { 2, 1, 7, 5, 4 };

        for (int i = 0; i < GetSort(numbers).Length; i++)
        {
            Response.Write(numbers[i]);
        }
          
    }
    //数字交互
    public int[] GetSort(int[] Numbers)
    {
        int i, j, temp;
        bool b = false;//状态标识
        for (i = 0; i < Numbers.Length - 1; i++)
        {
            for (j = i + 1; j < Numbers.Length; j++)
            {
                if (Numbers[i] > Numbers[j])//如果前面的数比后面的数大
                {
                    temp = Numbers[i];
                    Numbers[i] = Numbers[j];
                    Numbers[j] = temp;
                }
                b = true;//位置交互后 修改状态
            }
            if (b == false)//如果前面的数比后面的数小
            {
                break;//跳出循环
            }
        }
        return Numbers;
    }