C# 泛型List排序的实现

csharppublic class QuickSortList : ISortableList
{
 private List list;

 public QuickSortList(List list)
 {
 this.list = list;
 }

 public void Sort()
 {
 // 使用快速排序算法对列表进行排序 QuickSort(list,0, list.Count -1);
 }

 private void QuickSort(List list, int left, int right)
 {
 if (left < right)
 {
 int pivotIndex = Partition(list, left, right);

 // 递归地对左半部分和右半部分进行排序 QuickSort(list, left, pivotIndex -1);
 QuickSort(list, pivotIndex +1, right);
 }
 }

 private int Partition(List list, int left, int right)
 {
 T pivot = list[left];
 int i = left +1;
 int j = right;

 while (i <= j)
 {
 // 从左半部分找到一个比 pivot 大的元素 while (i <= j && Compare(list[i], pivot) < 0)
 i++;

 // 从右半部分找到一个比 pivot 小的元素 while (i <= j && Compare(list[j], pivot) >0)
 j--;

 if (i <= j)
 {
 Swap(list, i, j);
 i++;
 j--;
 }
 }

 return j;
 }

 private void Swap(List list, int i, int j)
 {
 T temp = list[i];
 list[i] = list[j];
 list[j] = temp;
 }

 private int Compare(T x, T y)
 {
 // 比较两个元素的大小 return Comparer.Default.Compare(x, y);
 }
}

csharp[TestMethod]
public void TestQuickSortList()
{
 List<int> list = new List<int>() {5,2,8,3,1,6,4 };

 QuickSortList<int> quickSortList = new QuickSortList<int>(list);
 quickSortList.Sort();

 CollectionAssert.AreEqual(new int[] {1,2,3,4,5,6,8 }, list);
}

[TestMethod]
public void TestQuickSortList_DuplicateElements()
{
 List<int> list = new List<int>() {5,2,8,3,1,6,4,2,8 };

 QuickSortList<int> quickSortList = new QuickSortList<int>(list);
 quickSortList.Sort();

 CollectionAssert.AreEqual(new int[] {1,2,2,3,4,5,6,8,8 }, list);
}