排序算法

     int[] max ={ 6, 5, 2, 9, 7, 4, 0 };
        for (int i = 0; i < max.Length; i++)
        {
            for (int j = i + 1; j < max.Length; j++)
            {
                if (max[i] < max[j])
                {
                    int temp = 0;
                    temp = max[i];
                    max[i] = max[j];
                    max[j] = temp;
                }
            }
        }