插入排序

public void InsertSort(int[] unsort){
            for (int i = 1; i < unsort.Length; i++)
            {
                if (unsort[i-1]>unsort[i])
                {
                    int temp = unsort[i];
                    int j = i;
                    while (j>0&&unsort[j-1]>temp)
                    {
                        unsort[j] = unsort[j - 1];
                        j--;
                    }
                    unsort[j] = temp;
                }
            }
}

        static void Main(string[] args)
        {
            int[] x = { 6, 2, 4, 1, 5, 9 };
            d(x);
            foreach (var item in x)
            {
                if (item > 0)
                    Console.WriteLine(item + ",");
            }
            Console.ReadLine();
        }