1         public static void Sort(T[] items)
 2         {
 3             if (items.Length < 2)
 4             {
 5                 return;
 6             }
 7 
 8             int swappedTimes;
 9             do
10             {
11                 swappedTimes = 0;
12                 // 重复的遍历数组。
13                 for (var i = 1; i < items.Length; i++)
14                 {
15                     // 每次遍历都比较两个元素，如果顺序不正确就把他们交换一下。
16                     if (items[i - 1].CompareTo(items[i]) > 0)
17                     {
18                         Swap(items, i - 1, i);
19                         swappedTimes++;
20                     }
21                 }
22             } while (swappedTimes > 1);// 如果遍历后只交换了 1 次或 0 次，排序结束。
23         }

 1         public static void Sort(T[] items)
 2         {
 3             for (
 4                 var sortedRangeEndIndex = 1;
 5                 sortedRangeEndIndex < items.Length;
 6                 sortedRangeEndIndex++)
 7             {
 8                 if (items[sortedRangeEndIndex].CompareTo(items[sortedRangeEndIndex - 1]) < 0)
 9                 {
10                     int insertIndex = FindInsertionIndex(items, items[sortedRangeEndIndex]);
11                     Insert(items, sortedRangeEndIndex, insertIndex);
12                 }
13             }
14         }
15 
16         private static int FindInsertionIndex(T[] items, T valueToInsert)
17         {
18             for (var i = 0; i < items.Length; i++)
19             {
20                 if (items[i].CompareTo(valueToInsert) > 0)
21                 {
22                     return i;
23                 }
24             }
25 
26             throw new InvalidOperationException();
27         }
28 
29         private static void Insert(T[] items, int indexInsertingFrom, int indexInsertingAt)
30         {
31             var temp = items[indexInsertingFrom];
32 
33             for (var i = indexInsertingFrom; i > indexInsertingAt; i--)
34             {
35                 items[i] = items[i - 1];
36             }
37 
38             items[indexInsertingAt] = temp;
39         }

 1         public static void Sort(T[] items)
 2         {
 3             for (
 4                 var sortedRangeEndIndex = 0;
 5                 sortedRangeEndIndex < items.Length;
 6                 sortedRangeEndIndex++)
 7             {
 8                 int nextIndex = FindIndexOfSmallestFromIndex(items, sortedRangeEndIndex);
 9                 Swap(items, sortedRangeEndIndex, nextIndex);
10             }
11         }
12 
13         private static int FindIndexOfSmallestFromIndex(T[] items, int sortedRangeEndIndex)
14         {
15             T currentSmallItem = items[sortedRangeEndIndex];
16             int currentSmllIndex = sortedRangeEndIndex;
17 
18             for (var i = sortedRangeEndIndex + 1; i < items.Length; i++)
19             {
20                 if (currentSmallItem.CompareTo(items[i]) > 0)
21                 {
22                     currentSmallItem = items[i];
23                     currentSmllIndex = i;
24                 }
25             }
26 
27             return currentSmllIndex;
28         }