About: Sorting algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Sorting algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

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:

Attributes	Values
rdf:type	Thing software
rdfs:label	Sorting algorithm (en)
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: (en)
rdfs:seeAlso	External sorting
sameAs	Sorting algorithm
dbp:wikiPageUsesTemplate	dbt:Annotated_link dbt:Citation dbt:Commons_category dbt:Disputed_inline dbt:Main dbt:Math dbt:Mvar dbt:N/A dbt:No dbt:Reflist dbt:See_also dbt:Short_description dbt:Sort dbt:Tmath dbt:Unreferenced_section dbt:Webarchive dbt:Wikibooks dbt:Yes dbt:Sorting dbt:Varies dbt:Data_structures_and_algorithms
Subject	Data processing Sorting algorithms
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Sorting_algorithm?oldid=1070735731&ns=0
Wikipage page ID	28442 (xsd:integer)
page length (characters) of wiki page	61960 (xsd:nonNegativeInteger)
Wikipage revision ID	1070735731 (xsd:integer)
has 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Sorting_algorithm
is rdfs:seeAlso of	Best, worst and average case
is Wikipage redirect of	Unstable sort Non-comparison sort Non-comparison sorting Distribution sort List of sorting algorithms Sorting Algorithm Comparison of sorting algorithms Stable sort Tag sort Exchange sort Sort (computing) Sort algorithm Sort algorithms Sorted list Sorting (computer science) Sorting Algorithms Sorting algorithms Sorting problem Unsorted list Stable sorting Stable sorting algorithm
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures Mark Davis (Unicode) 8-bit color ASCII Abstract structure Adaptive heap sort Adaptive sort Algorithm Algorithmic efficiency Algorithmic technique Algorithms + Data Structures = Programs Alphabetical order Anonymous function Applications of randomness Batcher odd–even mergesort Bead sort Best, worst and average case Binary heap Binary prioritization Binary search algorithm Binary search tree Binary tree Bitonic sorter Bitpit Block Range Index Block sort Bogosort Book embedding Non-comparison sort Non-comparison sorting Browser speed test Bubble sort Bucket sort Burstsort CPU time CUDA Cache-oblivious distribution sort Cartesian tree Glossary of computer graphics Glossary of computer science Gnome sort David Musser

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software