冒泡排序

int[] arr = { 23, 44, 66, 76, 98, 11, 3, 9, 7 };
int temp = 0;
for (int i = 0; i < arr.Length -1; i++)
{
    for (int j = 0; j < arr.Length -1 -i; j++)
    {
        //// 升序
        //if (arr[j] > arr[j + 1])
        //{
        //    temp = arr[j + 1];
        //    arr[j + 1] = arr[j];
        //    arr[j] = temp;
        //}

        // 降序
        if (arr[j] < arr[j + 1])
        {
            temp = arr[j + 1];
            arr[j + 1] = arr[j];
            arr[j] = temp;
        }
    }
}