Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Jump_search> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Jump_search abstract "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 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].The optimal value of m is √n, where n is the length of the list L. Because both steps of the algorithm look at, at most, √n items the algorithm runs in O(√n) time. This is better than a linear search, but worse than a binary search. The advantage over the latter is that a jump search only needs to jump backwards once, while a binary can jump backwards up to log n times. This can be important if a jumping backwards takes significantly more time than jumping forward.The algorithm can be modified by performing multiple levels of jump search on the sublists, before finally performing the linear search. For an k-level jump search the optimum block size ml for the lth level (counting from 1) is n(k-l)/k. The modified algorithm will perform k backward jumps and runs in O(kn1/(k+1)) time.".
- Jump_search wikiPageID "2569382".
- Jump_search wikiPageRevisionID "544111348".
- Jump_search hasPhotoCollection Jump_search.
- Jump_search subject Category:Search_algorithms.
- Jump_search type Abstraction100002137.
- Jump_search type Act100030358.
- Jump_search type Activity100407535.
- Jump_search type Algorithm105847438.
- Jump_search type Event100029378.
- Jump_search type Procedure101023820.
- Jump_search type PsychologicalFeature100023100.
- Jump_search type Rule105846932.
- Jump_search type SearchAlgorithms.
- Jump_search type YagoPermanentlyLocatedEntity.
- Jump_search comment "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 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].The optimal value of m is √n, where n is the length of the list L.".
- Jump_search label "Jump search".
- Jump_search sameAs m.07nnlv.
- Jump_search sameAs Q4922513.
- Jump_search sameAs Q4922513.
- Jump_search sameAs Jump_search.
- Jump_search wasDerivedFrom Jump_search?oldid=544111348.
- Jump_search isPrimaryTopicOf Jump_search.