插入排序算法

  private int[] Insertion(int[] sortData)
        {
            bool isAdded;
            int temp = 0;
            int currentLenth = 1; 
            afterSortData = new int[sortData.Length];
            if (sortData.Length >= 1)
                afterSortData[0] = sortData[0];
            for (int i = 1; i < sortData.Length; i++, currentLenth++)
            {
                isAdded = false;
                afterSortData[currentLenth] = sortData[i];
                for (int j = 0; j < currentLenth; j++)
                {
                    if (!isAdded)
                    {
                        if (sortData[i] < afterSortData[j])
                        {
                            temp = afterSortData[j];
                            afterSortData[currentLenth] = temp;
                            afterSortData[j] = sortData[i];
                            isAdded = true;
                        }
                    }
                    else
                    {
                        temp = afterSortData[currentLenth];
                        afterSortData[currentLenth] = afterSortData[j];
                        afterSortData[j] = temp;
                    }
                }
            }
            return afterSortData;
        }