アルファベット順の文字列をソートするC＃

Question

名前をアルファベット順に並べ替える機能を持つプログラムを作っていますが、Array.Sort（）を使いやすくなっていますが、関数の理解に役立つソート関数のアルゴリズムが必要です

ここで

Answer 1

Array.csです：http://www.dotnetframework.org/default.aspx/DotNET/DotNET/8@0/untmp/whidbey/REDBITS/ndp/clr/src/BCL/System/Array@cs/2/Array@cs 方法

彼らは例外のクイックソート-theyチェックを使用して、すべてがOKであれば、彼らはこの召喚並び替えがあります：

internal void QuickSort(int left, int right) { 
      // Can use the much faster jit helpers for array access. 
      do { 
       int i = left; 
       int j = right; 

       // pre-sort the low, middle (pivot), and high values in place. 
       // this improves performance in the face of already sorted data, or 
       // data that is made up of multiple sorted runs appended together. 
       int middle = GetMedian(i, j); 
       SwapIfGreaterWithItems(i, middle); // swap the low with the mid point 
       SwapIfGreaterWithItems(i, j);  // swap the low with the high 
       SwapIfGreaterWithItems(middle, j); // swap the middle with the high 

       Object x = keys[middle]; 
       do { 
        // Add a try block here to detect IComparers (or their 
        // underlying IComparables, etc) that are bogus. 
        try { 
         while (comparer.Compare(keys[i], x) < 0) i++; 
         while (comparer.Compare(x, keys[j]) < 0) j--; 
        } 
        catch (IndexOutOfRangeException) { 
         throw new ArgumentException(Environment.GetResourceString("Arg_BogusIComparer", x, x.GetType().Name, comparer)); 
        } 
        catch (Exception e) { 
         throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_IComparerFailed"), e); 
        } 
        catch { 
         throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_IComparerFailed")); 
        } 
        BCLDebug.Assert(i>=left && j<=right, "(i>=left && j<=right) Sort failed - Is your IComparer bogus?"); 
        if (i > j) break; 
        if (i < j) { 
         Object key = keys[i]; 
         keys[i] = keys[j]; 
         keys[j] = key; 
         if (items != null) { 
          Object item = items[i]; 
          items[i] = items[j]; 
          items[j] = item; 
         } 
        } 
        i++; 
        j--; 
       } while (i <= j); 
       if (j - left <= right - i) { 
        if (left < j) QuickSort(left, j); 
        left = i; 
       } 
       else { 
        if (i < right) QuickSort(i, right); 
        right = j; 
       } 
      } while (left < right); 
     } 
    } 

詳細情報は、それについて：https://en.wikipedia.org/wiki/Quicksort