algorithms/src/main/java/com/sort/basic/BubbleSort.java at master · verifyCode/algorithms · GitHub

Repository navigation

package com.sort.basic;

import com.sort.SortTestHelper;

import java.util.Arrays;

/**

* @author xjn

* @since 2020-05-01

* 时间复杂度O(n^2)

* 空间复杂度O(1)

* 稳定排序

public class BubbleSort {

public static void sort(int[] array) {

for (int i = 0; i < array.length; i++) {

for (int j = 1; j < array.length - i; j++) {

if (array[j - 1] > array[j]) {

SortTestHelper.swap(array, j, j - 1);

}

public static void sort2(int[] array) {

for (int i = 0; i < array.length; i++) {

for (int j = 0; j < array.length - i - 1; j++) {

if (array[j] > array[j + 1]) {

SortTestHelper.swap(array, j, j + 1);

}

public static void main(String[] args) {

int[] ints = SortTestHelper.generateRandomArray(10, 1, 10);

sort2(ints);

System.out.println(Arrays.toString(ints));

}