ALGORITHM READING NOTE

Merge Sort

Merge sort uses divide and conquer: split the array until pieces are trivial, then merge sorted pieces back together.

TYPEAlgorithmCATEGORYSortingDEPTHBeginnerTYPICAL COMPLEXITYO(n log n)

SHORT INTERVIEW ANSWER

Start with this mental model

Merge sort uses divide and conquer: split the array until pieces are trivial, then merge sorted pieces back together.

SIMPLE EXPLANATION

How it works, without unnecessary jargon

The merge step is linear because each side is already sorted.

There are log n levels of splitting, so total time is O(n log n). Standard array implementations use O(n) extra memory.

EXECUTION

Read the algorithm as a sequence of decisions

Understand what one pass/partition/merge guarantees.

Track which region is already finalized.

Reason about comparisons, swaps/moves and extra memory.

A small example to keep in mind

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

READABLE JAVASCRIPT IMPLEMENTATIONJavaScript

function mergeSort(a) {
  if (a.length <= 1) return a;
  const mid = Math.floor(a.length / 2);
  return merge(mergeSort(a.slice(0, mid)), mergeSort(a.slice(mid)));
}

function merge(left, right) {
  const out = [];
  let i = 0, j = 0;
  while (i < left.length && j < right.length) {
    out.push(left[i] <= right[j] ? left[i++] : right[j++]);
  }
  return out.concat(left.slice(i), right.slice(j));
}

How to read this code

Do not memorize the syntax. Follow the state that changes on each line and connect it to the invariant described above.

COMPLEXITY

O(n log 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.

WHEN TO USE IT

Good fit

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

COMMON MISTAKES

What usually goes wrong

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

HOW TO EXPLAIN IT IN AN INTERVIEW

A professional answer shape

Highlight predictable O(n log n), stability, and the extra-memory trade-off. It is also natural for linked lists and external sorting.

Problem→Core idea→Invariant / state→Big-O→Trade-off

QUICK INTERVIEW CHECK

What problem does Merge Sort solve?

Merge sort uses divide and conquer: split the array until pieces are trivial, then merge sorted pieces back together.

What should I mention about complexity?

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

What is the most common mistake?

Comparing only average Big-O.

Continue readingStable sortingIn-place sortingDivide and conquer

function mergeSort(a) { if (a.length <= 1) return a; const mid = Math.floor(a.length / 2); return merge(mergeSort(a.slice(0, mid)), mergeSort(a.slice(mid))); } function merge(left, right) { const out = []; let i = 0, j = 0; while (i < left.length && j < right.length) { out.push(left[i] <= right[j] ? left[i++] : right[j++]); } return out.concat(left.slice(i), right.slice(j)); }