实现泛型数组的冒泡排序算法 C#

public static class BubbleSortTool
    {
        public static void BubbleSort<T>(this T[] array, AscendingorDescending ascendingorDescending) where T:IComparable
        {
            switch (ascendingorDescending)
            {
                case AscendingorDescending.ascending:
                    {
                        while (!SortCompleteChecK(array, AscendingorDescending.ascending))
                        {
                            for (int i = ; i < (array.Length - ); i++)
                            {
                                if (array[i].CompareTo(array[i + ]) > )
                                {
                                    T temp = array[i];
                                    array[i] = array[i + ];
                                    array[i + ] = temp;
                                }
                            }
                        }
                    }
                    break;
                case AscendingorDescending.descending:
                    {
                        while (!SortCompleteChecK(array, AscendingorDescending.ascending))
                        {
                            for (int i = ; i < (array.Length - ); i++)
                            {
                                if (array[i].CompareTo(array[i + ]) < )
                                {
                                    T temp = array[i];
                                    array[i] = array[i + ];
                                    array[i + ] = temp;
                                }
                            }
                        }
                    }
                    break;
                default:
                    break;
            }
        }

        private static bool SortCompleteChecK<T>(T[] array, AscendingorDescending ascendingorDescending) where T : IComparable
        {
            switch (ascendingorDescending)
            {
                case AscendingorDescending.ascending:
                    {
                        for (int i = ; i < (array.Length-); i++)
                        {
                            if (array[i].CompareTo(array[i + ]) >  )
                            {
                                return false;
                            }
                        }
                        return true;
                    }
                    break;
                case AscendingorDescending.descending:
                    {
                        for (int i = ; i < (array.Length - ); i++)
                        {
                            if (array[i].CompareTo(array[i + ]) < )
                            {
                                return false;
                            }
                        }
                        return true;
                    }
                    break;
                default:
                    { throw new Exception(); }
                    break;
            }

        }

        public enum AscendingorDescending
        {
            ascending,descending
        }

        public static void Print<T>(this T[] array)
        {
            StringBuilder sb = new StringBuilder();
            for (int i = ; i < array.Length; i++)
            {
                sb.Append(array[i]);
                sb.Append(" ");
            }
            Console.WriteLine(sb);
        }
        public static void Print<T>(this T[] array,String prompt)
        {
            StringBuilder sb = new StringBuilder();
            sb.Append(prompt);
            for (int i = ; i < array.Length; i++)
            {
                sb.Append(array[i]);
                sb.Append(" ");
            }
            Console.WriteLine(sb);
        }
    }