c# 排序算法总结

 /// <summary>
         /// 冒泡排序法1
         /// </summary>
         /// <param name="list"></param>
          public static void BubbleSort(int[] list)
          {
              for (int i = ; i < list.Length; i++)
              {
                  for (int j = i; j < list.Length; j++)
                  {
                      if (list[i] < list[j])
                      {
                         int temp = list[i];
                         list[i] = list[j];
                         list[j] = temp;
                     }
                 }
             }
         }

  /// <summary>
         /// 插入排序法
         /// </summary>
         /// <param name="list"></param>
         public static void InsertionSort(int[] list)
         {
             for (int i = ; i < list.Length; i++)
              {
                 int t = list[i];
                 int j = i;
                 while ((j > ) && (list[j - ] > t))
                 {
                     list[j] = list[j - ];
                     --j;
                 }
                 list[j] = t;
             }
         }

//// <summary>
         /// 选择排序法
         /// </summary>
         /// <param name="list"></param>
         public static void SelectionSort(int[] list)
         {
             int min;
             for (int i = ; i < list.Length - ; i++)
             {
                 min = i;
                 for (int j = i + ; j < list.Length; j++)
                 {
                     if (list[j] < list[min])
                         min = j;
                 }
                 int t = list[min];
                 list[min] = list[i];
                 list[i] = t;
             }
         }

        //// <summary>
        /// 希尔排序法
        /// </summary>
        /// <param name="list"></param>
        public static void ShellSort(int[] list)
        {
             int inc;
             for (inc = ; inc <= list.Length / ; inc =  * inc + ) ;
             for (; inc > ; inc /= )
             {
                 for (int i = inc + ; i <= list.Length; i += inc)
                 {
                     int t = list[i - ];
                     int j = i;
                     while ((j > inc) && (list[j - inc - ] > t))
                     {
                         list[j - ] = list[j - inc - ];
                         j -= inc;
                     }
                     list[j - ] = t;
                 }
             }
         }

private static void Swap(ref int l, ref int r)
         {
             int s;
             s = l;
             l = r;
             r = s;
         }

 /// 快速排序法
         /// </summary>
         /// <param name="list"></param>
         /// <param name="low"></param>
         /// <param name="high"></param>
public static void Sort(int[] list, int low, int high)
         {
             int pivot;
             int l, r;
             int mid;
             if (high <= low)
                 return;
             else if (high == low + )
             {
                 if (list[low] > list[high])
                     Swap(ref list[low], ref list[high]);
                 return;
             }
             mid = (low + high) >> ;
             pivot = list[mid];
             Swap(ref list[low], ref list[mid]);
             l = low + ;
             r = high;
             do
             {
                 while (l <= r && list[l] < pivot)
                     l++;
                 while (list[r] >= pivot)
                     r--;
                 if (l < r)
                     Swap(ref list[l], ref list[r]);
             } while (l < r);
             list[low] = list[r];
             list[r] = pivot;
             if (low +  < r)
                 Sort(list, low, r - );
             if (r +  < high)
                 Sort(list, r + , high);
         }