Selection sort
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.
Wikipage redirect
Algorithmic efficiencyBig O notationBingo sortBubble sortBucket queueCartesian treeCocktail shaker sortComparison sortGlossary of computer scienceHeapsortIn-place algorithmInput enhancement (computer science)Insertion sortInteger sortingInternal sortList of algorithmsList of terms relating to algorithms and data structuresOnline algorithmPancake sortingPartial sortingPerformance tuningPriority queueQuicksortSelect sortSelection SortSelection algorithmSelectionsortSelectsortSorted arraySortingSorting algorithmTime complexityTournament sort
Link from a Wikipage to another Wikipage
primaryTopic
Selection sort
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.
has abstract
A ordenação por seleção (do in ...... até os últimos dois elementos.
@pt
El ordenamiento por selección ...... enar una lista de n elementos.
@es
In computer science, selection ...... waps, n − 1 in the worst case.
@en
L'ordinamento per selezione (s ...... a dalla dimensione dell'array.
@it
Le tri par sélection (ou tri p ...... non en temps pseudo linéaire.
@fr
Selection sort is een sorteera ...... complexiteitsgraad van O(n2).
@nl
Selectionsort (englisch select ...... ExchangeSort (AustauschSort).
@de
Sortowanie przez wybieranie - ...... b,1] → [1,2b,2a] (gdzie 2b=2a)
@pl
Urvalssortering är en av de en ...... Algoritmens komplexitet blir .
@sv
Řazení výběrem (anglicky selec ...... tejně dlouho jako neseřazený).
@cs
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,296,014
Link from a Wikipage to another Wikipage
average-time
О comparisons, О swaps
@en
best-time
О comparisons, O swaps
@en
caption
Selection sort animation
@en
class
date
2015-03-07
optimal
No
@en
space
O auxiliary
@en
stable
No
@en
time
О comparisons, О swaps
@en
title
Animated Sorting Algorithms: Selection Sort
@en
wikiPageUsesTemplate
hypernym
type
comment
A ordenação por seleção (do in ...... até os últimos dois elementos.
@pt
El ordenamiento por selección ...... enar una lista de n elementos.
@es
In computer science, selection ...... e auxiliary memory is limited.
@en
L'ordinamento per selezione (s ...... a dalla dimensione dell'array.
@it
Le tri par sélection (ou tri p ...... non en temps pseudo linéaire.
@fr
Selection sort is een sorteera ...... complexiteitsgraad van O(n2).
@nl
Selectionsort (englisch select ...... ExchangeSort (AustauschSort).
@de
Sortowanie przez wybieranie - ...... ego do najmniejszego elementu.
@pl
Urvalssortering är en av de en ...... Algoritmens komplexitet blir .
@sv
Řazení výběrem (anglicky selec ...... jako Heapsort nebo Mergesort.
@cs
label
Ordenamiento por selección
@es
Selection sort
@en
Selection sort
@it
Selection sort
@nl
Selection sort
@pt
Selectionsort
@de
Sortowanie przez wybieranie
@pl
Tri par sélection
@fr
Urvalssortering
@sv
Řazení výběrem
@cs