/// <summary>
    /// 插入排序
    /// </summary>
    public void Inser_Sort()
    {
        int[] list = new int[] { };
        int tmp;
        for (int i = 1; i < list.Length; i++)
        {
            int j = i - 1;
            tmp = list[i];
            while (j>=0 && tmp<list[j])
            {
                list[j + 1] = list[j];
                j--;
            }
            list[j + 1] = tmp;
        }
    }
    /// <summary>
    /// 冒泡排序
    /// </summary>
    public void Bubble_Sort()
    {
        int[] list = new int[] { };
        int tmp;
        for (int i = 0; i < list.Length-1; i++)
        {
            for (int j = 1; j < list.Length - 1-i; j++)
            {
                if (list[j-1]<list[j])
                {
                    tmp = list[j - 1];
                    list[j - 1] = list[j];
                    list[j] = tmp;
                }
            }
        }
    }
    /// <summary>
    /// 選擇排序
    /// </summary>
    public void Select_Sort()
    {
        int[] list = new int[] { };
        int tmp;
        int min;
        for (int i = 0; i < list.Length-1; i++)
        {
            min = i;
            for (int j = i+1; j < list.Length-1; j++)
            {
                if (list[min]>list[j])
                {
                    min = j;
                }
            }
            tmp = list[i];
            list[i] = list[min];
            list[min] = tmp;
        }
    }