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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n6http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Hybrid_algorithm
rdf:type
dbo:Software
rdfs:label
Hybrid algorithm
rdfs:comment
A hybrid algorithm is an algorithm that combines two or more other algorithms that solve the same problem, and is mostly used in programming languages like C++, either choosing one (depending on the data), or switching between them over the course of the algorithm. This is generally done to combine desired features of each, so that the overall algorithm is better than the individual components.
owl:sameAs
freebase:m.0wxv6mv yago-res:Hybrid_algorithm
dbp:wikiPageUsesTemplate
dbt:Unreferenced
dct:subject
dbc:Algorithms
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
n6:Hybrid_algorithm?oldid=1058854181&ns=0
dbo:wikiPageID
40338559
dbo:wikiPageLength
4329
dbo:wikiPageRevisionID
1058854181
dbo:wikiPageWikiLink
dbr:Sorting_algorithm dbr:Quicksort dbr:Median_of_medians dbr:Distributed_algorithm dbr:Introsort dbr:Algorithm dbr:Quickselect dbr:Recursion_(computer_science) dbr:Hybrid_algorithm_(constraint_satisfaction) dbr:Heapsort dbr:Timsort dbr:Introselect dbr:C++ dbr:Bucket_sort dbc:Algorithms dbr:External_sorting dbr:MapReduce dbr:Divide-and-conquer_algorithm dbr:Memetic_algorithm dbr:Flashsort dbr:Binary_search_algorithm dbr:Merge_sort dbr:Computer_science dbr:Hybrid_input-output_algorithm
dbo:abstract
A hybrid algorithm is an algorithm that combines two or more other algorithms that solve the same problem, and is mostly used in programming languages like C++, either choosing one (depending on the data), or switching between them over the course of the algorithm. This is generally done to combine desired features of each, so that the overall algorithm is better than the individual components. "Hybrid algorithm" does not refer to simply combining multiple algorithms to solve a different problem – many algorithms can be considered as combinations of simpler pieces – but only to combining algorithms that solve the same problem, but differ in other characteristics, notably performance.
foaf:isPrimaryTopicOf
n6:Hybrid_algorithm