算法阅读笔记

Insertion Sort

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

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

简短面试回答

先从这个心智模型开始

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

简单解释

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

It behaves like sorting playing cards in your hand.

It is O(n²) generally, but performs well on small or nearly sorted input and is stable.

执行过程

把算法读成一连串决策

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 Insertion Sort, the goal is to make the invariant visible rather than to memorize code.

易读的 JavaScript 实现JavaScript

function insertionSort(input) {
  const a = [...input];
  for (let i = 1; i < a.length; i++) {
    const value = a[i];
    let j = i - 1;
    while (j >= 0 && a[j] > value) {
      a[j + 1] = a[j];
      j--;
    }
    a[j + 1] = value;
  }
  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.

常见错误

通常哪里会出错

Comparing only average Big-O.
Forgetting stability, in-place behavior, recursion depth or key-domain assumptions.

面试中如何解释

专业回答结构

Mention adaptive behavior on nearly sorted data and why insertion sort is often used for small partitions inside hybrid sort implementations.

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

快速面试检查

What problem does Insertion Sort solve?

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

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

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

最常见的错误是什么？

Comparing only average Big-O.

继续阅读Stable sortingIn-place sortingDivide and conquer

function insertionSort(input) { const a = [...input]; for (let i = 1; i < a.length; i++) { const value = a[i]; let j = i - 1; while (j >= 0 && a[j] > value) { a[j + 1] = a[j]; j--; } a[j + 1] = value; } return a; }