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

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

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n15	http://dbpedia.org/resource/Template:N/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n10	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Sorting_algorithm

rdf:type

owl:Thing dbo:Software

rdfs:label

Sorting algorithm

rdfs:comment

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output. Formally, the output of any sorting algorithm must satisfy two conditions:

rdfs:seeAlso

dbr:External_sorting

owl:sameAs

freebase:m.071c4

dbp:wikiPageUsesTemplate

dbt:No dbt:See_also dbt:Citation dbt:Unreferenced_section dbt:Sorting dbt:Tmath dbt:Reflist dbt:Mvar dbt:Commons_category dbt:Data_structures_and_algorithms dbt:Main dbt:Annotated_link dbt:Short_description dbt:Disputed_inline dbt:Math dbt:Yes dbt:Varies dbt:Sort dbt:Wikibooks n15:A dbt:Webarchive

dct:subject

dbc:Sorting_algorithms dbc:Data_processing

gold:hypernym

dbr:Algorithm

prov:wasDerivedFrom

n10:Sorting_algorithm?oldid=1070735731&ns=0

dbo:wikiPageID

28442

dbo:wikiPageLength

61960

dbo:wikiPageRevisionID

1070735731

dbo:abstract

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output. Formally, the output of any sorting algorithm must satisfy two conditions: 1. * The output is in monotonic order (each element is no smaller/larger than the previous element, according to the required order). 2. * The output is a permutation (a reordering, yet retaining all of the original elements) of the input. For optimum efficiency, the input data should be stored in a data structure which allows random access rather than one that allows only sequential access.

foaf:isPrimaryTopicOf

n10:Sorting_algorithm