c#冒泡排序

冒泡排序：从大到小

    public void BubbleSort(double[] data) {
        for (int i = 0; i < data.Length - 1; i++)
        {
            for (int j = 0; j <data.Length - 1 - i; j++)
            {
                if (data[j] < data[j + 1])
                {
                    data[j] = data[j] + data[j + 1];
                    data[j + 1] = data[j] - data[j + 1];
                    data[j] = data[j] - data[j + 1];
                }
            }
        }
    }

冒泡排序：从小到大

    public void BubbleSort(double[] data) {
        for (int i = 0; i < data.Length - 1; i++)
        {
            for (int j = 0; j <data.Length - 1 - i; j++)
            {
                if (data[j] > data[j + 1])
                {
                    data[j] = data[j] + data[j + 1];
                    data[j + 1] = data[j] - data[j + 1];
                    data[j] = data[j] - data[j + 1];
                }
            }
        }
    }