Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Sorting algorithms

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Sorting algorithms

Merge Sort

intermediatelayer B7 · Sorting algorithms5 tests

Implement merge sort: return a new array holding nums in ascending order.

  • You may not call Array.prototype.sort — the point is to write the algorithm
  • The input array must be left unchanged; return a new array
  • Duplicates, negatives, an empty array and a single element must all work
  • Merge sort is O(n log n) in every case: log n levels of splitting, and each level merges a total of n elements

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen