Bubble, selection, insertion: O(n²). Useful to understand swaps and “sorted prefix.” Merge sort: split, sort halves, merge — O(n log n) time, extra O(n) memory, stable (equal keys keep order). Quick sort: partition around a pivot — O(n log n) average, O(n²) worst (already sorted + bad pivot), in-place, not stable in the usual implementation.
Interviews more often ask: merge two sorted arrays, or “why is this O(n log n)?” Language sort is fine in production; know what it guarantees. JS Array.prototype.sort is not guaranteed stable in very old engines; modern ECMAScript requires a stable sort.
Judge: Merge two sorted arrays.