本文实例讲述了C#冒泡法排序算法。分享给大家供大家参考。具体实现方法如下:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | 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; } } } } |
泛型版本:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | 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; } } } } |