This HTML5 document contains 54 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/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n7http://people.csail.mit.edu/rivest/pubs/
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n12https://core.ac.uk/download/pdf/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Introselect
dbo:wikiPageWikiLink
dbr:Floyd–Rivest_algorithm
Subject Item
dbr:Quickselect
dbo:wikiPageWikiLink
dbr:Floyd–Rivest_algorithm
Subject Item
dbr:Floyd-Rivest_algorithm
dbo:wikiPageWikiLink
dbr:Floyd–Rivest_algorithm
dbo:wikiPageRedirects
dbr:Floyd–Rivest_algorithm
Subject Item
dbr:Floyd–Rivest_algorithm
rdf:type
yago:Procedure101023820 yago:Algorithm105847438 yago:Activity100407535 yago:PsychologicalFeature100023100 yago:Abstraction100002137 dbo:Software yago:YagoPermanentlyLocatedEntity yago:Rule105846932 yago:WikicatSelectionAlgorithms yago:Act100030358 yago:Event100029378
rdfs:label
Floyd–Rivest algorithm
rdfs:comment
In computer science, the Floyd-Rivest algorithm is a selection algorithm developed by Robert W. Floyd and Ronald L. Rivest that has an optimal expected number of comparisons within lower-order terms. It is functionally equivalent to quickselect, but runs faster in practice on average. It has an expected running time of O(n) and an expected number of comparisons of n + min(k, n − k) + O(n1/2 log1/2 n).
dbp:name
Floyd–Rivest
dcterms:subject
dbc:Selection_algorithms
dbo:wikiPageID
40417327
dbo:wikiPageRevisionID
1096413384
dbo:wikiPageWikiLink
dbr:Divide_and_conquer_algorithm dbr:Sampling_(statistics) dbr:Median_of_medians dbr:Quickselect dbr:Computer_science dbr:Ronald_L._Rivest dbc:Selection_algorithms dbr:Pseudocode dbr:Selection_algorithm dbr:Array_data_structure dbr:Introselect dbr:Lower-order_terms dbr:Robert_W._Floyd dbr:Communications_of_the_ACM
dbo:wikiPageExternalLink
n7:FR75a.pdf n12:82672439.pdf%7C
owl:sameAs
wikidata:Q17047365 freebase:m.0wzx02y n18:fDeo
dbp:wikiPageUsesTemplate
dbt:Math dbt:Infobox_Algorithm dbt:Cite_journal dbt:Refbegin dbt:Refend dbt:Reflist
dbp:class
dbr:Selection_algorithm
dbp:data
dbr:Array_data_structure
dbo:abstract
In computer science, the Floyd-Rivest algorithm is a selection algorithm developed by Robert W. Floyd and Ronald L. Rivest that has an optimal expected number of comparisons within lower-order terms. It is functionally equivalent to quickselect, but runs faster in practice on average. It has an expected running time of O(n) and an expected number of comparisons of n + min(k, n − k) + O(n1/2 log1/2 n). The algorithm was originally presented in a Stanford University technical report containing two papers, where it was referred to as SELECT and paired with PICK, or median of medians. It was subsequently published in Communications of the ACM, Volume 18: Issue 3.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Floyd–Rivest_algorithm?oldid=1096413384&ns=0
dbo:wikiPageLength
7707
foaf:isPrimaryTopicOf
wikipedia-en:Floyd–Rivest_algorithm
Subject Item
wikipedia-en:Floyd–Rivest_algorithm
foaf:primaryTopic
dbr:Floyd–Rivest_algorithm