Glossary: System Design Beyond the Basics in JavaScript

Binary search

Also written: bisectRight, bisectLeft

A fast way to find a position in a sorted array by repeatedly checking the middle and discarding half of the remaining range. It is used to find the next point clockwise on a hash ring and to find matches in sorted lists such as typeahead suggestions.