Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the input list element by element, comparing the current element with the one after it, swapping their values if needed. These passes through the list are repeated until no swaps had to be performed during a pass, meaning that the list has become fully sorted. The algorithm, which is a comparison sort, is named for the way the larger elements "bubble" up to the top of the list. 【冒泡排序（有时称为下沉排序）是一种简单的排序算法，它逐个元素地重复遍历输入列表，将当前元素与其后面的元素进行比较，并在需要时交换它们的值。 重复对列表的这些遍历，直到在遍历期间不必执行交换，这意味着列表已完全排序。 该算法是一种比较排序，因其较大的元素“冒泡”到列表顶部的方式而得名。】