About: Selection sort   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

Selection Sort is a list sorting algorithm. It is very easy to implement but is rather inefficient.

AttributesValues
rdfs:label
  • Selection sort
rdfs:comment
  • Selection Sort is a list sorting algorithm. It is very easy to implement but is rather inefficient.
  • Selection sort algorithm example from TThread demo of Delphi 5: procedure TSelectionSort.Sort(var A: array of Integer); var I, J, T: Integer; begin for I := Low(A) to High(A) - 1 do for J := High(A) downto I + 1 do if A[I] > A[J] then begin VisualSwap(A[I], A[J], I, J); T := A[I]; A[I] := A[J]; A[J] := T; if Terminated then Exit; end; end;
sameAs
dcterms:subject
dbkwik:code/proper...iPageUsesTemplate
dbkwik:delphi/prop...iPageUsesTemplate
abstract
  • Selection Sort is a list sorting algorithm. It is very easy to implement but is rather inefficient.
  • Selection sort algorithm example from TThread demo of Delphi 5: procedure TSelectionSort.Sort(var A: array of Integer); var I, J, T: Integer; begin for I := Low(A) to High(A) - 1 do for J := High(A) downto I + 1 do if A[I] > A[J] then begin VisualSwap(A[I], A[J], I, J); T := A[I]; A[I] := A[J]; A[J] := T; if Terminated then Exit; end; end;
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software