What this snippet does
Binary search is O(log n) — each comparison eliminates half the remaining candidates. Requires a sorted array.
Expected output
3 -1
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
- merge sortAlgorithms · advanced
- two pointersAlgorithms · intermediate
- sliding windowAlgorithms · intermediate
- dynamic programmingAlgorithms · advanced
- flatten arrayAlgorithms · intermediate
- BFS traversalAlgorithms · advanced