This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n7https://github.com/adrianuswarmenhoven/
freebasehttp://rdf.freebase.com/ns/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8https://github.com/adrianuswarmenhoven/uniformbinarysearch_go/blob/master/Pascal/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbpedia-thhttp://th.dbpedia.org/resource/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Uniform_binary_search
rdf:type
yago:PsychologicalFeature100023100 yago:Procedure101023820 yago:YagoPermanentlyLocatedEntity yago:Abstraction100002137 yago:Act100030358 yago:Event100029378 yago:Activity100407535 yago:Algorithm105847438 yago:Rule105846932 yago:WikicatSearchAlgorithms dbo:Software
rdfs:label
Uniform binary search
rdfs:comment
Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth's The Art of Computer Programming. It uses a lookup table to update a single array index, rather than taking the midpoint of an upper and a lower bound on each iteration; therefore, it is optimized for architectures (such as Knuth's MIX) on which * a table lookup is generally faster than an addition and a shift, and * many searches will be performed on the same array, or on several arrays of the same length
dcterms:subject
dbc:Search_algorithms dbc:Articles_with_example_C_code
dbo:wikiPageID
4004215
dbo:wikiPageRevisionID
969434609
dbo:wikiPageWikiLink
dbr:Pascal_(programming_language) dbr:Binary_search_algorithm dbr:C_(programming_language) dbr:Binary_search dbc:Search_algorithms dbr:The_Art_of_Computer_Programming dbr:Lookup_table dbc:Articles_with_example_C_code dbr:MIX dbr:Donald_Knuth dbr:Go_(programming_language)
dbo:wikiPageExternalLink
n7:uniformbinarysearch_go n8:unizoek.pas
owl:sameAs
freebase:m.0bc2b6 dbpedia-fa:جستجوی_دودویی_یکپارچه n15:4Zhom yago-res:Uniform_binary_search wikidata:Q4925115 dbpedia-th:การค้นหาแบบทวิภาคอย่างมีเอกรูป
dbo:abstract
Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth's The Art of Computer Programming. It uses a lookup table to update a single array index, rather than taking the midpoint of an upper and a lower bound on each iteration; therefore, it is optimized for architectures (such as Knuth's MIX) on which * a table lookup is generally faster than an addition and a shift, and * many searches will be performed on the same array, or on several arrays of the same length
gold:hypernym
dbr:Optimization
prov:wasDerivedFrom
wikipedia-en:Uniform_binary_search?oldid=969434609&ns=0
dbo:wikiPageLength
2257
foaf:isPrimaryTopicOf
wikipedia-en:Uniform_binary_search