插入排序算法

 1   private int[] Insertion(int[] sortData)
 2         {
 3             bool isAdded;
 4             int temp = 0;
 5             int currentLenth = 1; 
 6             afterSortData = new int[sortData.Length];
 7             if (sortData.Length >= 1)
 8                 afterSortData[0] = sortData[0];
 9             for (int i = 1; i < sortData.Length; i++, currentLenth++)
10             {
11                 isAdded = false;
12                 afterSortData[currentLenth] = sortData[i];
13                 for (int j = 0; j < currentLenth; j++)
14                 {
15                     if (!isAdded)
16                     {
17                         if (sortData[i] < afterSortData[j])
18                         {
19                             temp = afterSortData[j];
20                             afterSortData[currentLenth] = temp;
21                             afterSortData[j] = sortData[i];
22                             isAdded = true;
23                         }
24                     }
25                     else
26                     {
27                         temp = afterSortData[currentLenth];
28                         afterSortData[currentLenth] = afterSortData[j];
29                         afterSortData[j] = temp;
30                     }
31                 }
32             }
33             return afterSortData;
34         }

转载于:https://www.cnblogs.com/bingxueme/archive/2012/05/15/2501900.html