Engrain by ByteRush

DSA.04 3 concepts

Sorting and searching

Know the main sorting algorithms, their trade-offs and binary search.

  1. DSA.04.01Elementary sorts and stabilityCoreJuniorBeing written
  2. DSA.04.02Merge sort, quicksort and heapsortCoreMid-levelBeing written
  3. DSA.04.03Sorting in JavaScriptCoreJuniorBeing written

Interview questions in this module

  1. Compare merge sort and quicksort.
  2. What does it mean for a sort to be stable? Is JavaScript's sort stable?
  3. What algorithm does V8 use for sort?
  4. Why does [10, 9, 1].sort() return [1, 10, 9]?
  5. When can you sort faster than O(n log n)?