简单快速排序 C#

找到基准，分区，递归

 1 public static int[] QuickSort(int[] array)
 2 {
 3     if (array.Length < 2)
 4     {
 5         return array;
 6     }
 7     else
 8     {
 9         var pivot = array[0];
10         var less = array.Where(t => t < pivot).ToArray();
11         var greater = array.Where(t => t > pivot).ToArray();
12         return QuickSort(less).Append(pivot).Concat(QuickSort(greater)).ToArray();
13     }
14 }

 

转载于:https://www.cnblogs.com/64mb/p/11130668.html