class PRogram{    static void Main(string[] args)    {        int[] array = new[] { 234, 632, 23, 643, 2, 6, -2, 423, 2342,43 };        Console.WriteLine("排序前：");        Console.WriteLine(string.Join(",", array));        InsertSort(array);        Console.WriteLine("排序后：");        Console.WriteLine(string.Join(",", array));        Console.ReadKey();    }    /// <summary>    /// 直接插入排序    /// </summary>    /// <param name="sources">目標數組</param>    private static void InsertSort(int[] sources)    {        // 從索引1開始，假設sources[0]已經有序        for (int i = 1, len = sources.Length - 1; i <= len; i++)        {            // 準備要插入的數據            int insertValue = sources[i],            // 假設要插入的索引            insertIndex = i - 1;            // 遍歷查找插入的索引位置            while (insertIndex >= 0 && insertValue < sources[insertIndex])            {                // 當前數據后移一位                sources[insertIndex + 1] = sources[insertIndex];                insertIndex--;            }                        // 不滿足以上條件，說明找到位置，插入數據            sources[insertIndex + 1] = insertValue;        }    }        /// <summary>    /// 直接插入排序 for實現    /// </summary>    /// <param name="sources">目標數組</param>    private static void InsertSort1(int[] sources)    {        for (int i = 1, len = sources.Length - 1; i <= len; i++)        {            for (int j = i; j > 0; j--)            {                if (sources[j] > sources[j - 1]) // > 降序， < 升序                {                    int temp = sources[j];                    sources[j] = sources[j - 1];                    sources[j - 1] = temp;                }            }        }    }}