算法阅读笔记

Bubble Sort

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

类型算法分类Sorting深度初级典型复杂度O(n²)

简短面试回答

先从这个心智模型开始

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

简单解释

它如何工作，不堆砌不必要的术语

After one full pass, the largest unsorted value is in its final position.

With an early-exit flag, an already sorted array can finish in O(n).

执行过程

把算法读成一连串决策

Understand what one pass/partition/merge guarantees.

Track which region is already finalized.

Reason about comparisons, swaps/moves and extra memory.

记住一个小例子

Read a tiny input by hand and write down the state after every important operation. For Bubble Sort, the goal is to make the invariant visible rather than to memorize code.

易读的 JavaScript 实现JavaScript

function bubbleSort(input) {
  const a = [...input];
  for (let end = a.length - 1; end > 0; end--) {
    let swapped = false;
    for (let i = 0; i < end; i++) {
      if (a[i] > a[i + 1]) {
        [a[i], a[i + 1]] = [a[i + 1], a[i]];
        swapped = true;
      }
    }
    if (!swapped) break;
  }
  return a;
}

如何阅读这段代码

不要死记语法。跟踪每一行中发生变化的状态，并把它与上面描述的不变量联系起来。

复杂度

O(n²)

Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.

何时使用

适用场景

Choose based on input size, order, key range, stability and memory limits.

常见错误

通常哪里会出错

Forgetting the shrinking end boundary.
Using it for large real workloads where O(n²) is too expensive.

面试中如何解释

专业回答结构

Use it mainly to demonstrate sorting fundamentals, stability and best/average/worst-case reasoning rather than as a production default.

问题→核心思路→不变量 / 状态→Big-O→权衡

快速面试检查

What problem does Bubble Sort solve?

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

关于复杂度应该提到什么？

Its typical cost here is O(n²), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

最常见的错误是什么？

Forgetting the shrinking end boundary.

继续阅读Stable sortingIn-place sortingDivide and conquer

function bubbleSort(input) { const a = [...input]; for (let end = a.length - 1; end > 0; end--) { let swapped = false; for (let i = 0; i < end; i++) { if (a[i] > a[i + 1]) { [a[i], a[i + 1]] = [a[i + 1], a[i]]; swapped = true; } } if (!swapped) break; } return a; }