C# · 12月 28, 2021

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

本文实例讲述了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; } } } }

希望本文所述对大家的C#程序设计有所帮助。