冒泡排序及其时间空间复杂度

Posted 2022-05-09 Vincent（朱志强）

    public static void bubbleSort(int[] numbers) 
        if (numbers == null || numbers.length < 2) 
            return;
        
        for (int round = 0; round < numbers.length - 1; round++) 
            boolean swapped = false;
            for (int index = 0; index < numbers.length - round - 1; index++) 
                if (numbers[index] > numbers[index + 1]) 
                    int temp = numbers[index];
                    numbers[index] = numbers[index + 1];
                    numbers[index + 1] = temp;
                    swapped = true
                
            
            if (!swapped) 
                return;