C#冒泡法排序算法实例分析

static void BubbleSort(IComparable[] array) {   int i, j;   IComparable temp;   for (i = array.Length - 1; i > 0; i--)   {     for (j = 0; j < i; j++)     {       if (array[j].CompareTo(array[j + 1]) > 0)       {         temp = array[j];         array[j] = array[j + 1];         array[j + 1] = temp;       }     }   } }

static void BubbleSort<T>(IList<T> list) where T : IComparable<T> {   for (int i = list.Count - 1; i > 0; i--)   {     for (int j = 0; j < i; j++)     {       IComparable current = list[j];       IComparable next = list[j + 1];       if (current.CompareTo(next) > 0)       {         list[j] = next;         list[j + 1] = current;       }     }   } }