Content deleted Content added
m WPWP4OWR2023 Tag: Reverted |
m Reverted edit by Chinemeremprince (talk) to last version by MrOllie |
||
Line 12:
|stable=No
}}
In [[computer science]], '''selection sort''' is an [[in-place algorithm|in-place]] [[comparison sort|comparison]] [[sorting algorithm]]. It has an [[Big O notation|O]](''n''<sup>2</sup>) [[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.
| |||