| Information | |
|---|---|
| has gloss | eng: In computer science, a jump search or block search refers to a search algorithm for ordered lists. It works by first checking all items Lkm, where k \in \mathbbN} and m is the block size, until an item is found that is larger than the search key. To find the exact position of the search key in the list a linear search is performed on the sublist L[(k-1)m, km]. |
| lexicalization | eng: jump search |
| instance of | e/Search algorithm |
Lexvo © 2008-2026 Gerard de Melo. Contact Legal Information / Imprint