What this snippet does
Merge sort is O(n log n) and stable — it divides the array in half recursively, then merges sorted halves back together.
Expected output
[ 3, 9, 10, 27, 38, 43, 82 ]
Why practise typing this
Typing algorithms code builds muscle memory for the symbols and indentation JavaScript uses most, which prose-based typing tests never cover. DevType measures your words per minute and accuracy on this snippet and tracks the individual characters you mistype, so later lessons can target them.
More JavaScript practice
- binary searchAlgorithms · intermediate
- two pointersAlgorithms · intermediate
- sliding windowAlgorithms · intermediate
- dynamic programmingAlgorithms · advanced
- flatten arrayAlgorithms · intermediate
- BFS traversalAlgorithms · advanced