Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Exponential_search> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Exponential_search abstract "In computer science, an exponential search (also called doubling search or galloping search) is an algorithm, created by Jon Bentley and Andrew Chi-Chih Yao in 1976, for searching sorted, unbounded/infinite lists. There are numerous ways to implement this with the most common being to determine a range that the search key resides in and performing a binary search within that range. This takes O(log i) where i is the position of the search key in the list, if the search key is in the list, or the position where the search key should be, if the search key is not in the list.Exponential search can also be used to search in bounded lists. Exponential search can even out-perform more traditional searches for bounded lists, such as binary search, when the element being searched for is near the beginning of the array. This is because exponential search will run in O(log i) time, where i is the index of the element being searched for in the list, whereas binary search would run in O(log n) time, where n is the number of elements in the list.".
- Exponential_search wikiPageID "42285695".
- Exponential_search wikiPageLength "9279".
- Exponential_search wikiPageOutDegree "20".
- Exponential_search wikiPageRevisionID "707826892".
- Exponential_search wikiPageWikiLink Algorithm.
- Exponential_search wikiPageWikiLink Andrew_Yao.
- Exponential_search wikiPageWikiLink Array_data_structure.
- Exponential_search wikiPageWikiLink Big_O_notation.
- Exponential_search wikiPageWikiLink Binary_search_algorithm.
- Exponential_search wikiPageWikiLink Category:Search_algorithms.
- Exponential_search wikiPageWikiLink Computer_science.
- Exponential_search wikiPageWikiLink Exponentiation.
- Exponential_search wikiPageWikiLink Hash_table.
- Exponential_search wikiPageWikiLink Interpolation_search.
- Exponential_search wikiPageWikiLink Jon_Bentley_(computer_scientist).
- Exponential_search wikiPageWikiLink Linear_search.
- Exponential_search wikiPageWikiLink Search_algorithm.
- Exponential_search wikiPageWikiLink Splay_tree.
- Exponential_search wikiPageWikiLink Ternary_search.
- Exponential_search wikiPageWikiLinkText "Exponential search".
- Exponential_search wikiPageWikiLinkText "exponential search".
- Exponential_search averageTime Big_O_notation.
- Exponential_search bestTime Big_O_notation.
- Exponential_search class Search_algorithm.
- Exponential_search data Array_data_structure.
- Exponential_search optimal "Yes".
- Exponential_search space Big_O_notation.
- Exponential_search time Big_O_notation.
- Exponential_search wikiPageUsesTemplate Template:Infobox_algorithm.
- Exponential_search wikiPageUsesTemplate Template:Reflist.
- Exponential_search wikiPageUsesTemplate Template:Sup.
- Exponential_search subject Category:Search_algorithms.
- Exponential_search hypernym Algorithm.
- Exponential_search type Software.
- Exponential_search comment "In computer science, an exponential search (also called doubling search or galloping search) is an algorithm, created by Jon Bentley and Andrew Chi-Chih Yao in 1976, for searching sorted, unbounded/infinite lists. There are numerous ways to implement this with the most common being to determine a range that the search key resides in and performing a binary search within that range.".
- Exponential_search label "Exponential search".
- Exponential_search sameAs Q17012914.
- Exponential_search sameAs m.010gr0nj.
- Exponential_search sameAs Q17012914.
- Exponential_search wasDerivedFrom Exponential_search?oldid=707826892.
- Exponential_search isPrimaryTopicOf Exponential_search.