About: Selection sort

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

About: Selection sort Goto Sponge NotDistinct Permalink

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

In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n2) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity and has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.

Attributes	Values
rdf:type	software
rdfs:label	Selection sort (en)
rdfs:comment	In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n2) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity and has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited. (en)
sameAs	Selection sort Selection sort
dbp:wikiPageUsesTemplate	dbt:ISBN dbt:No_footnotes dbt:Refbegin dbt:Refend dbt:Reflist dbt:Short_description dbt:Unreferenced_section dbt:Webarchive dbt:Wikibooks dbt:Sorting dbt:PAGENAMEBASE dbt:Infobox_Algorithm
Subject	Articles with example C code Comparison sorts Sorting algorithms
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Selection_sort?oldid=1073431000&ns=0
Wikipage page ID	29352 (xsd:integer)
page length (characters) of wiki page	12227 (xsd:nonNegativeInteger)
Wikipage revision ID	1073431000 (xsd:integer)
has abstract	In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n2) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity and has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited. The algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right. The time efficiency of selection sort is quadratic, so there are a number of sorting techniques which have better time complexity than selection sort. One thing which distinguishes selection sort from other sorting algorithms is that it makes the minimum possible number of swaps, n − 1 in the worst case. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Selection_sort
is Wikipage redirect of	Selection Sort Select sort Selectionsort Selectsort Bingo sort
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures Algorithmic efficiency Big O notation Bubble sort Bucket queue Bucket sort Cartesian tree Glossary of computer science Cocktail shaker sort Comparison sort List of algorithms In-place algorithm Heapsort Input enhancement (computer science) Insertion sort Integer sorting Internal sort Bingo sort

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