aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Initial data commit

Browse source
This commit is contained in:
Ingy döt Net 2023-07-01 11:58:00 -04:00
parent 72d218235f
commit f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

25
Task/Sorting-algorithms-Selection-sort/00-TASK.txt Normal file
View file

@ -0,0 +1,25 @@
{{Sorting Algorithm}}
[[Category:Sorting]]
;Task:
Sort an [[array]] (or list) of elements using the Selection sort algorithm.
It works as follows:
First find the smallest element in the array and exchange it with the element in the first position, then find the second smallest element and exchange it with the element in the second position, and continue in this way until the entire array is sorted.
Its asymptotic complexity is &nbsp; <big> [[O]](n<sup>2</sup>) </big> &nbsp; making it inefficient on large arrays.
Its primary purpose is for when writing data is very expensive (slow) when compared to reading, eg. writing to flash memory or EEPROM.
No other sorting algorithm has less data movement.
;References:
* &nbsp; Rosetta Code: &nbsp; [[O]] &nbsp; &nbsp; (complexity).
* &nbsp; Wikipedia: &nbsp; [[wp:Selection_sort|Selection sort]].
* &nbsp; Wikipedia: &nbsp; [[https://en.wikipedia.org/wiki/Big_O_notation Big O notation]].
<br><br>