C#中的冒泡排序和选择排序

/// <summary>
    /// 冒泡排序
    /// </summary>
    private static void bubblesort()
    {
        int temp = 0;
        int[] arr = new int[] { 6, 3, 9, 20, 2 };
        for (int i = 0; i < arr.Length; i++)
        {
            //这里的j<arr.Length-1-i;不能写成arr.Length-1;
            for (int j = 0; j < arr.Length - 1 - i; j++)
            {
                if (arr[j] > arr[j + 1])
                {
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
    }

/// <summary>
    /// 选择排序
    /// </summary>
    private static void selectionsort()
    {
        int temp = 0;
        int[] arr = new int[] { 6, 3, 9 };
        for (int i = 0; i < arr.Length; i++)
        {
            for (int j = i + 1; j < arr.Length - 1; j++)
            {
                if (arr[i] > arr[j])
                {
                    temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }
        }
    }