用C#和策略模式實現各種排序方法及性能測試

1.說明一下，其中的SuperSort是我之前《專爲手機號碼設計的特殊的排序》 中講到的方法，《編程珠璣》書中有詳細說明。

2.另外，我是通過策略模式呈現這集中排序的，還是費了一番心思的，如果有高手有更加好的方式（設計模式）進行呈現，非常期待。我是菜鳥，虛心求教！

3.還有一些排序方法，比如“合併排序”，“基數排序”。。。以後有空補上。

4.上代碼！

class Program { static void Main(string[] args) { List<List<int>> iiList = new List<List<int>>(); int num = 8; for (int i = 0; i < num; i++) { List<int> listInt = getRandomList(100000, 80000); iiList.Add(listInt); } List<ChooseSort> listCS = new List<ChooseSort>(); listCS.Add(new ChooseSort(new SuperSort())); listCS.Add(new ChooseSort(new SelectSort1())); listCS.Add(new ChooseSort(new SelectSort2())); listCS.Add(new ChooseSort(new PopSort())); listCS.Add(new ChooseSort(new InsertSort())); listCS.Add(new ChooseSort(new ShellSort())); listCS.Add(new ChooseSort(new HeapSort())); listCS.Add(new ChooseSort(new QuickSort())); for (int i = 0; i < num; i++) { listCS[i].ToSort(iiList[i]); } Console.ReadLine(); } /// <summary> /// 返回[1,max]中的隨機排序的num個數字 /// </summary> /// <param name="max"></param> /// <param name="num"></param> /// <returns></returns> static List<int> getRandomList(int max, int num) { List<int> listInt; if (max < num) { listInt = null; } else { listInt = new List<int>(); List<int> container = new List<int>(max); for (int i = 1; i < max + 1; i++) { container.Add(i); } Random r = new Random(DateTime.Now.Millisecond); int index = -1; int value = -1; for (int j = 0; j < num; j++) { index = r.Next(0, container.Count); value = container[index]; listInt.Add(value); container.RemoveAt(index); } } return listInt; } static void showList(List<int> listInt) { foreach (int i in listInt) { Console.Write(i + " "); } Console.WriteLine(); } } class ChooseSort { SortBase sb = null; public ChooseSort(SortBase sb) { this.sb = sb; } public List<int> ToSort(List<int> listInt) { StopWatch sw = new StopWatch(); sw.setStart(); listInt = this.sb.sort(listInt); sw.setEnd(); Console.WriteLine(sb.GetType().Name + ":" + sw.getTime()); return listInt; } } abstract class SortBase { public abstract List<int> sort(List<int> listInt); } class SuperSort : SortBase { public override List<int> sort(List<int> listInt) { int count = 100000; int num = 0; List<bool> listBool = new List<bool>(count + 1);//listBool的0位我不要了 for (int i = 0; i <= count; i++) { bool b = false; listBool.Add(b); } foreach (int i in listInt) { listBool[i] = true; } for (int j = 1; j <= count; j++) { if (listBool[j] == true) { listInt[num] = j; num++; } } return listInt; } } class SelectSort1 : SortBase { public override List<int> sort(List<int> listInt) { int index = -1; List<int> listTemp = listInt; listInt = new List<int>(); for (int i = 0; i < listTemp.Count; ) { int max = -1; for (int j = 0; j < listTemp.Count; j++) { if (max < listTemp[j]) { max = listTemp[j]; index = j; } } listTemp.RemoveAt(index); listInt.Add(max); } return listInt; } } class SelectSort2 : SortBase { public override List<int> sort(List<int> listInt) { int index = -1; for (int i = 0; i < listInt.Count; i++) { int max = -1; for (int j = 0; j < listInt.Count - i; j++) { if (max < listInt[j]) { max = listInt[j]; index = j; } } listInt.RemoveAt(index); listInt.Add(max); } return listInt; } } class PopSort : SortBase { public override List<int> sort(List<int> listInt) { bool ifSwaped; int temp = 0; for (int i = 0; i < listInt.Count - 1; i++) { ifSwaped = false; for (int j = 0; j < listInt.Count - i - 1; j++) { if (listInt[j] > listInt[j + 1]) { temp = listInt[j]; listInt[j] = listInt[j + 1]; listInt[j + 1] = temp; ifSwaped = true; } } if (ifSwaped == false) break; } return listInt; } } class InsertSort : SortBase { public override List<int> sort(List<int> listInt) { int temp = 0; for (int i = 1; i < listInt.Count; i++) { if (listInt[i] < listInt[i - 1]) { temp = listInt[i]; int j = i; for (; j > 0 && listInt[j - 1] > temp; j--) { listInt[j] = listInt[j - 1]; } listInt[j] = temp; } } return listInt; } } class ShellSort : SortBase { public override List<int> sort(List<int> listInt) { List<int> list1 = new List<int>(); List<int> list2 = new List<int>(); InsertSort iSort = new InsertSort(); for (int i = 0; i <= Math.Abs(listInt.Count / 2); i++) { list1.Add(listInt[i]); } for (int i = Math.Abs(listInt.Count / 2) + 1, j = 0; i < listInt.Count; i++, j++) { list2.Add(listInt[i]); } list1 = iSort.sort(list1); list2 = iSort.sort(list2); int flag = 0; bool t; for (int j = 0; j < list2.Count; j++) { t = false; for (int k = flag; k < list1.Count; k++) { if (list1[k] <= list2[j]) { } else { flag = k + 1; list1.Add(list1[list1.Count - 1]); for (int i = list1.Count - 1; i > k; i--) { list1[i] = list1[i - 1]; } list1[k] = list2[j]; t = true; break; } } if (t == false) list1.Add(list2[j]); } return list1; } } class HeapSort : SortBase { public override List<int> sort(List<int> listInt) { int temp; multyBuildHeap(listInt); for (int i = listInt.Count; i > 0; i--) { temp = listInt[i - 1]; listInt[i - 1] = listInt[0]; listInt[0] = temp; Heapify(listInt, 0, i - 1); } return listInt; } #region HeapSort用到的方法 /// <summary> /// 將1-p_3重新調整爲堆，僅有listInt[p]違反堆 /// 樓上是以前寫的，不看代碼不知道什麼意思了，看來註釋還是要好好寫啊 /// </summary> /// <param name="listInt"></param> /// <param name="p"></param> /// <param name="p_3"></param> static void Heapify(IList<int> listInt, int p, int p_3) { int temp; if ((2 * (p + 1)) <= p_3) { if ((2 * (p + 1) + 1) <= p_3 && (listInt[p] < Math.Max(listInt[2 * (p + 1)], listInt[2 * (p + 1) - 1]))) { if (listInt[2 * (p + 1)] > listInt[2 * (p + 1) - 1]) { temp = listInt[2 * (p + 1)]; listInt[2 * (p + 1)] = listInt[p]; listInt[p] = temp; Heapify(listInt, 2 * (p + 1), p_3); } else { temp = listInt[2 * (p + 1) - 1]; listInt[2 * (p + 1) - 1] = listInt[p]; listInt[p] = temp; Heapify(listInt, 2 * (p + 1) - 1, p_3); } } else { if (listInt[p] < listInt[2 * (p + 1) - 1]) { temp = listInt[p]; listInt[p] = listInt[2 * (p + 1) - 1]; listInt[2 * (p + 1) - 1] = temp; Heapify(listInt, 2 * (p + 1) - 1, p_3); } } } } static void multyBuildHeap(IList<int> listInt) { int level = getLevel(listInt); for (int i = 0; i < level; i++) { BuildHeap(listInt); } } static void BuildHeap(IList<int> listInt) { int temp; int count = listInt.Count; int level = getLevel(listInt); int lastNum = count / 2; if (count % 2 == 1) { temp = Math.Max(Math.Max(listInt[lastNum - 1], listInt[count - 1]), listInt[count - 2]); if (listInt[lastNum - 1] != temp) { if (listInt[count - 1] > listInt[count - 2]) { listInt[count - 1] = listInt[lastNum - 1]; listInt[lastNum - 1] = temp; } else { listInt[count - 2] = listInt[lastNum - 1]; listInt[lastNum - 1] = temp; } } } else { if (listInt[lastNum - 1] < listInt[count - 1]) { temp = listInt[count - 1]; listInt[count - 1] = listInt[lastNum - 1]; listInt[lastNum - 1] = temp; } } for (int i = lastNum - 1; i > 0; i--) { temp = Math.Max(Math.Max(listInt[i - 1], listInt[2 * i - 1]), listInt[2 * i]); if (listInt[i - 1] != temp) { if (listInt[2 * i - 1] > listInt[2 * i]) { listInt[2 * i - 1] = listInt[i - 1]; listInt[i - 1] = temp; } else { listInt[2 * i] = listInt[i - 1]; listInt[i - 1] = temp; } } } } /// <summary> /// 計算有多少層 /// </summary> /// <param name="listInt"></param> /// <returns></returns> static int getLevel(IList<int> listInt) { return (Int32)Math.Ceiling(Math.Log(listInt.Count + 1, 2)); } /// <summary> /// 將數列以樹的形式展示 /// </summary> /// <param name="listInt"></param> static void showTree(IList<int> listInt) { int level = (Int32)Math.Ceiling(Math.Log(listInt.Count + 1, 2)); //展示一棵樹 for (int i = 0, j = 1; i < listInt.Count; i++) { if (j == 1) { for (int k = 0; k < level * 4; k++) { Console.Write(" "); } level--; } Console.Write("{0,4}", listInt[i]); if (j == 1) { Console.WriteLine(); for (int k = 0; k < level * 4; k++) { Console.Write(" "); } level--; j *= 4; } else { if (i + 2 == j) { Console.WriteLine(); for (int k = 0; k < level * 4; k++) { Console.Write(" "); } level--; j *= 2; } } } } #endregion } class QuickSort : SortBase { public override List<int> sort(List<int> listInt) { qSort(listInt, 0, listInt.Count - 1); return listInt; } private void qSort(List<int> listInt,int left,int right) { int i, j; int middle, temp; i = left; j = right; middle = listInt[(left + right) / 2]; do { while (listInt[i] < middle && i < right) i++; while (listInt[j] > middle && j > left) j--; if (i <= j) { temp = listInt[i]; listInt[i] = listInt[j]; listInt[j] = temp; i++; j--; } } while (i <= j); if (left < j) qSort(listInt, left, j); if (right > i) qSort(listInt, i, right); } }

關於效率，上圖

 

說明一下，其實SuperSort有時候是15毫秒，原因是，實際是在0~15之間，而這裏的精度就是15毫秒。