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

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

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